TSTP Solution File: SYO582+1 by iProver-SAT---3.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver-SAT---3.6
% Problem  : SYO582+1 : TPTP v8.1.0. Released v5.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python3 prover_driver.py --schedule_mode external --no_cores 8 --heuristic_context fnt --schedule fnt_schedule --problem_version fof /export/starexec/sandbox2/benchmark/theBenchmark.p 300 --prover /export/starexec/sandbox2/solver/bin/res/iproveropt_no_z3

% Computer : n002.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep 30 00:41:58 EDT 2022

% Result   : CounterSatisfiable 1.20s 1.51s
% Output   : Model 1.20s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
%------ Negative definition of b48_buttercup10519 
fof(lit_def,axiom,
    ! [X0] :
      ( ~ b48_buttercup10519(X0)
    <=> ( X0 = sK6
        | X0 = sK8
        | X0 = sK12 ) ) ).

%------ Negative definition of b48_buttercup10417 
fof(lit_def_001,axiom,
    ! [X0] :
      ( ~ b48_buttercup10417(X0)
    <=> $false ) ).

%------ Negative definition of b48_buttercup10222 
fof(lit_def_002,axiom,
    ! [X0] :
      ( ~ b48_buttercup10222(X0)
    <=> $false ) ).

%------ Negative definition of k04_buttercup10419 
fof(lit_def_003,axiom,
    ! [X0] :
      ( ~ k04_buttercup10419(X0)
    <=> $false ) ).

%------ Positive definition of k04_buttercup10225 
fof(lit_def_004,axiom,
    ! [X0] :
      ( k04_buttercup10225(X0)
    <=> ( X0 = sK1
        | X0 = sK7
        | X0 = sK14
        | X0 = sK21
        | X0 = sK22
        | X0 = sK30 ) ) ).

%------ Positive definition of sP0_iProver_split 
fof(lit_def_005,axiom,
    ( sP0_iProver_split
  <=> $true ) ).

%------ Positive definition of sP1_iProver_split 
fof(lit_def_006,axiom,
    ( sP1_iProver_split
  <=> $false ) ).

%------ Positive definition of sP2_iProver_split 
fof(lit_def_007,axiom,
    ( sP2_iProver_split
  <=> $false ) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SYO582+1 : TPTP v8.1.0. Released v5.5.0.
% 0.07/0.12  % Command  : python3 prover_driver.py --schedule_mode external --no_cores 8 --heuristic_context fnt --schedule fnt_schedule --problem_version fof /export/starexec/sandbox2/benchmark/theBenchmark.p 300 --prover /export/starexec/sandbox2/solver/bin/res/iproveropt_no_z3
% 0.12/0.33  % Computer : n002.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Mon Sep  5 14:30:18 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.20/1.51  % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.20/1.51  
% 1.20/1.51  %---------------- iProver v3.6 (pre CASC-J11 2022) ----------------%
% 1.20/1.51  
% 1.20/1.51  ------  iProver source info
% 1.20/1.51  
% 1.20/1.51  git: date: 2022-07-26 19:47:37 +0300
% 1.20/1.51  git: sha1: 69e283425f6c8ae3fb9e67f2058d741e849b12e1
% 1.20/1.51  git: non_committed_changes: false
% 1.20/1.51  git: last_make_outside_of_git: false
% 1.20/1.51  
% 1.20/1.51  ------ Parsing...
% 1.20/1.51  ------ Clausification by vclausify_rel  & Parsing by iProver...------  preprocesses with Option_epr_non_horn_non_eq
% 1.20/1.51  
% 1.20/1.51  
% 1.20/1.51  ------ Preprocessing... sf_s  rm: 11 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 1.20/1.51  
% 1.20/1.51  ------ Preprocessing...------  preprocesses with Option_epr_non_horn_non_eq
% 1.20/1.51   gs_s  sp: 3 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 1.20/1.51  ------ Proving...
% 1.20/1.51  ------ Problem Properties 
% 1.20/1.51  
% 1.20/1.51  
% 1.20/1.51  clauses                                 21
% 1.20/1.51  conjectures                             10
% 1.20/1.51  EPR                                     21
% 1.20/1.51  Horn                                    18
% 1.20/1.51  unary                                   13
% 1.20/1.51  binary                                  2
% 1.20/1.51  lits                                    35
% 1.20/1.51  lits eq                                 0
% 1.20/1.51  fd_pure                                 0
% 1.20/1.51  fd_pseudo                               0
% 1.20/1.51  fd_cond                                 0
% 1.20/1.51  fd_pseudo_cond                          0
% 1.20/1.51  AC symbols                              0
% 1.20/1.51  
% 1.20/1.51  ------ Schedule EPR non Horn non eq is on
% 1.20/1.51  
% 1.20/1.51  ------ no equalities: superposition off 
% 1.20/1.51  
% 1.20/1.51  ------ Input Options "--resolution_flag false" Time Limit: 70.
% 1.20/1.51  
% 1.20/1.51  
% 1.20/1.51  ------ 
% 1.20/1.51  Current options:
% 1.20/1.51  ------ 
% 1.20/1.51  
% 1.20/1.51  
% 1.20/1.51  
% 1.20/1.51  
% 1.20/1.51  ------ Proving...
% 1.20/1.51  
% 1.20/1.51  
% 1.20/1.51  % SZS status CounterSatisfiable for theBenchmark.p
% 1.20/1.51  
% 1.20/1.51  ------ Building Model...Done
% 1.20/1.51  
% 1.20/1.51  %------ The model is defined over ground terms (initial term algebra).
% 1.20/1.51  %------ Predicates are defined as (\forall x_1,..,x_n  ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) 
% 1.20/1.51  %------ where \phi is a formula over the term algebra.
% 1.20/1.51  %------ If we have equality in the problem then it is also defined as a predicate above, 
% 1.20/1.51  %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.20/1.51  %------ See help for --sat_out_model for different model outputs.
% 1.20/1.51  %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.20/1.51  %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.20/1.51  % SZS output start Model for theBenchmark.p
% See solution above
% 1.20/1.51  ------                               Statistics
% 1.20/1.51  
% 1.20/1.51  ------ Problem properties
% 1.20/1.51  
% 1.20/1.51  clauses:                                21
% 1.20/1.51  conjectures:                            10
% 1.20/1.51  epr:                                    21
% 1.20/1.51  horn:                                   18
% 1.20/1.51  ground:                                 16
% 1.20/1.51  unary:                                  13
% 1.20/1.51  binary:                                 2
% 1.20/1.51  lits:                                   35
% 1.20/1.51  lits_eq:                                0
% 1.20/1.51  fd_pure:                                0
% 1.20/1.51  fd_pseudo:                              0
% 1.20/1.51  fd_cond:                                0
% 1.20/1.51  fd_pseudo_cond:                         0
% 1.20/1.51  ac_symbols:                             0
% 1.20/1.51  
% 1.20/1.51  ------ General
% 1.20/1.51  
% 1.20/1.51  abstr_ref_over_cycles:                  0
% 1.20/1.51  abstr_ref_under_cycles:                 0
% 1.20/1.51  gc_basic_clause_elim:                   0
% 1.20/1.51  num_of_symbols:                         148
% 1.20/1.51  num_of_terms:                           452
% 1.20/1.51  
% 1.20/1.51  parsing_time:                           0.008
% 1.20/1.51  unif_index_cands_time:                  0.
% 1.20/1.51  unif_index_add_time:                    0.
% 1.20/1.51  orderings_time:                         0.
% 1.20/1.51  out_proof_time:                         0.
% 1.20/1.51  total_time:                             0.05
% 1.20/1.51  
% 1.20/1.51  ------ Preprocessing
% 1.20/1.51  
% 1.20/1.51  num_of_splits:                          3
% 1.20/1.51  num_of_split_atoms:                     3
% 1.20/1.51  num_of_reused_defs:                     0
% 1.20/1.51  num_eq_ax_congr_red:                    0
% 1.20/1.51  num_of_sem_filtered_clauses:            11
% 1.20/1.51  num_of_subtypes:                        0
% 1.20/1.51  monotx_restored_types:                  0
% 1.20/1.51  sat_num_of_epr_types:                   0
% 1.20/1.51  sat_num_of_non_cyclic_types:            0
% 1.20/1.51  sat_guarded_non_collapsed_types:        0
% 1.20/1.51  num_pure_diseq_elim:                    0
% 1.20/1.51  simp_replaced_by:                       0
% 1.20/1.51  res_preprocessed:                       0
% 1.20/1.51  sup_preprocessed:                       0
% 1.20/1.51  prep_upred:                             0
% 1.20/1.51  prep_unflattend:                        0
% 1.20/1.51  prep_well_definedness:                  0
% 1.20/1.51  smt_new_axioms:                         0
% 1.20/1.51  pred_elim_cands:                        2
% 1.20/1.51  pred_elim:                              14
% 1.20/1.51  pred_elim_cl:                           41
% 1.20/1.51  pred_elim_cycles:                       16
% 1.20/1.51  merged_defs:                            8
% 1.20/1.51  merged_defs_ncl:                        0
% 1.20/1.51  bin_hyper_res:                          8
% 1.20/1.51  prep_cycles:                            2
% 1.20/1.51  
% 1.20/1.51  splitting_time:                         0.
% 1.20/1.51  sem_filter_time:                        0.
% 1.20/1.51  monotx_time:                            0.
% 1.20/1.51  subtype_inf_time:                       0.
% 1.20/1.51  res_prep_time:                          0.009
% 1.20/1.51  sup_prep_time:                          0.
% 1.20/1.51  pred_elim_time:                         0.002
% 1.20/1.51  bin_hyper_res_time:                     0.
% 1.20/1.51  prep_time_total:                        0.013
% 1.20/1.51  
% 1.20/1.51  ------ Propositional Solver
% 1.20/1.51  
% 1.20/1.51  prop_solver_calls:                      9
% 1.20/1.51  prop_fast_solver_calls:                 414
% 1.20/1.51  smt_solver_calls:                       0
% 1.20/1.51  smt_fast_solver_calls:                  0
% 1.20/1.51  prop_num_of_clauses:                    131
% 1.20/1.51  prop_preprocess_simplified:             1116
% 1.20/1.51  prop_fo_subsumed:                       0
% 1.20/1.51  
% 1.20/1.51  prop_solver_time:                       0.
% 1.20/1.51  prop_fast_solver_time:                  0.
% 1.20/1.51  prop_unsat_core_time:                   0.
% 1.20/1.51  smt_solver_time:                        0.
% 1.20/1.51  smt_fast_solver_time:                   0.
% 1.20/1.51  
% 1.20/1.51  ------ QBF
% 1.20/1.51  
% 1.20/1.51  qbf_q_res:                              0
% 1.20/1.51  qbf_num_tautologies:                    0
% 1.20/1.51  qbf_prep_cycles:                        0
% 1.20/1.51  
% 1.20/1.51  ------ BMC1
% 1.20/1.51  
% 1.20/1.51  bmc1_current_bound:                     -1
% 1.20/1.51  bmc1_last_solved_bound:                 -1
% 1.20/1.51  bmc1_unsat_core_size:                   -1
% 1.20/1.51  bmc1_unsat_core_parents_size:           -1
% 1.20/1.51  bmc1_merge_next_fun:                    0
% 1.20/1.51  
% 1.20/1.51  bmc1_unsat_core_clauses_time:           0.
% 1.20/1.51  
% 1.20/1.51  ------ Instantiation
% 1.20/1.51  
% 1.20/1.51  inst_num_of_clauses:                    31
% 1.20/1.51  inst_num_in_passive:                    0
% 1.20/1.51  inst_num_in_active:                     31
% 1.20/1.51  inst_num_of_loops:                      33
% 1.20/1.51  inst_num_in_unprocessed:                0
% 1.20/1.51  inst_num_of_learning_restarts:          0
% 1.20/1.51  inst_num_moves_active_passive:          0
% 1.20/1.51  inst_lit_activity:                      0
% 1.20/1.51  inst_lit_activity_moves:                0
% 1.20/1.51  inst_num_tautologies:                   0
% 1.20/1.51  inst_num_prop_implied:                  0
% 1.20/1.51  inst_num_existing_simplified:           0
% 1.20/1.51  inst_num_eq_res_simplified:             0
% 1.20/1.51  inst_num_child_elim:                    0
% 1.20/1.51  inst_num_of_dismatching_blockings:      0
% 1.20/1.51  inst_num_of_non_proper_insts:           5
% 1.20/1.51  inst_num_of_duplicates:                 0
% 1.20/1.51  inst_inst_num_from_inst_to_res:         0
% 1.20/1.51  
% 1.20/1.51  inst_time_sim_new:                      0.
% 1.20/1.51  inst_time_sim_given:                    0.
% 1.20/1.51  inst_time_dismatching_checking:         0.
% 1.20/1.51  inst_time_total:                        0.001
% 1.20/1.51  
% 1.20/1.51  ------ Resolution
% 1.20/1.51  
% 1.20/1.51  res_num_of_clauses:                     18
% 1.20/1.51  res_num_in_passive:                     0
% 1.20/1.51  res_num_in_active:                      0
% 1.20/1.51  res_num_of_loops:                       90
% 1.20/1.51  res_forward_subset_subsumed:            3
% 1.20/1.51  res_backward_subset_subsumed:           0
% 1.20/1.51  res_forward_subsumed:                   0
% 1.20/1.51  res_backward_subsumed:                  0
% 1.20/1.51  res_forward_subsumption_resolution:     0
% 1.20/1.51  res_backward_subsumption_resolution:    0
% 1.20/1.51  res_clause_to_clause_subsumption:       1
% 1.20/1.51  res_subs_bck_cnt:                       0
% 1.20/1.51  res_orphan_elimination:                 0
% 1.20/1.51  res_tautology_del:                      10
% 1.20/1.51  res_num_eq_res_simplified:              0
% 1.20/1.51  res_num_sel_changes:                    0
% 1.20/1.51  res_moves_from_active_to_pass:          0
% 1.20/1.51  
% 1.20/1.51  res_time_sim_new:                       0.
% 1.20/1.51  res_time_sim_fw_given:                  0.001
% 1.20/1.51  res_time_sim_bw_given:                  0.
% 1.20/1.51  res_time_total:                         0.006
% 1.20/1.51  
% 1.20/1.51  ------ Superposition
% 1.20/1.51  
% 1.20/1.51  sup_num_of_clauses:                     21
% 1.20/1.51  sup_num_in_active:                      0
% 1.20/1.51  sup_num_in_passive:                     21
% 1.20/1.51  sup_num_of_loops:                       0
% 1.20/1.51  sup_fw_superposition:                   0
% 1.20/1.51  sup_bw_superposition:                   0
% 1.20/1.51  sup_eq_factoring:                       0
% 1.20/1.51  sup_eq_resolution:                      0
% 1.20/1.51  sup_immediate_simplified:               0
% 1.20/1.51  sup_given_eliminated:                   0
% 1.20/1.51  comparisons_done:                       0
% 1.20/1.51  comparisons_avoided:                    0
% 1.20/1.51  sup_deep_cl_discarded:                  0
% 1.20/1.51  sup_num_of_deepenings:                  0
% 1.20/1.51  sup_num_of_restarts:                    0
% 1.20/1.51  
% 1.20/1.51  sup_time_generating:                    0.
% 1.20/1.51  sup_time_sim_fw_full:                   0.
% 1.20/1.51  sup_time_sim_bw_full:                   0.
% 1.20/1.51  sup_time_sim_fw_immed:                  0.
% 1.20/1.51  sup_time_sim_bw_immed:                  0.
% 1.20/1.51  sup_time_prep_sim_fw_input:             0.
% 1.20/1.51  sup_time_prep_sim_bw_input:             0.
% 1.20/1.51  sup_time_total:                         0.
% 1.20/1.51  
% 1.20/1.51  ------ Simplifications
% 1.20/1.51  
% 1.20/1.51  sim_repeated:                           0
% 1.20/1.51  sim_fw_subset_subsumed:                 0
% 1.20/1.51  sim_bw_subset_subsumed:                 0
% 1.20/1.51  sim_fw_subsumed:                        0
% 1.20/1.51  sim_bw_subsumed:                        0
% 1.20/1.51  sim_fw_subsumption_res:                 0
% 1.20/1.51  sim_bw_subsumption_res:                 0
% 1.20/1.51  sim_fw_unit_subs:                       0
% 1.20/1.51  sim_bw_unit_subs:                       0
% 1.20/1.51  sim_tautology_del:                      0
% 1.20/1.51  sim_eq_tautology_del:                   0
% 1.20/1.51  sim_eq_res_simp:                        0
% 1.20/1.51  sim_fw_demodulated:                     0
% 1.20/1.51  sim_bw_demodulated:                     0
% 1.20/1.51  sim_encompassment_demod:                0
% 1.20/1.51  sim_light_normalised:                   0
% 1.20/1.51  sim_ac_normalised:                      0
% 1.20/1.51  sim_joinable_taut:                      0
% 1.20/1.51  sim_joinable_simp:                      0
% 1.20/1.51  sim_fw_ac_demod:                        0
% 1.20/1.51  sim_bw_ac_demod:                        0
% 1.20/1.51  sim_smt_subsumption:                    0
% 1.20/1.51  sim_smt_simplified:                     0
% 1.20/1.51  sim_ground_joinable:                    0
% 1.20/1.51  sim_bw_ground_joinable:                 0
% 1.20/1.51  sim_connectedness:                      0
% 1.20/1.51  
% 1.20/1.51  sim_time_fw_subset_subs:                0.
% 1.20/1.51  sim_time_bw_subset_subs:                0.
% 1.20/1.51  sim_time_fw_subs:                       0.
% 1.20/1.51  sim_time_bw_subs:                       0.
% 1.20/1.51  sim_time_fw_subs_res:                   0.
% 1.20/1.51  sim_time_bw_subs_res:                   0.
% 1.20/1.51  sim_time_fw_unit_subs:                  0.
% 1.20/1.51  sim_time_bw_unit_subs:                  0.
% 1.20/1.51  sim_time_tautology_del:                 0.
% 1.20/1.51  sim_time_eq_tautology_del:              0.
% 1.20/1.51  sim_time_eq_res_simp:                   0.
% 1.20/1.51  sim_time_fw_demod:                      0.
% 1.20/1.51  sim_time_bw_demod:                      0.
% 1.20/1.51  sim_time_light_norm:                    0.
% 1.20/1.51  sim_time_joinable:                      0.
% 1.20/1.51  sim_time_ac_norm:                       0.
% 1.20/1.51  sim_time_fw_ac_demod:                   0.
% 1.20/1.51  sim_time_bw_ac_demod:                   0.
% 1.20/1.51  sim_time_smt_subs:                      0.
% 1.20/1.51  sim_time_fw_gjoin:                      0.
% 1.20/1.51  sim_time_fw_connected:                  0.
% 1.20/1.51  
% 1.20/1.51  
%------------------------------------------------------------------------------