TSTP Solution File: SYN335+1 by iProver-SAT---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver-SAT---3.8
% Problem : SYN335+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d SAT
% Computer : n010.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 1 03:16:25 EDT 2023
% Result : CounterSatisfiable 3.86s 1.14s
% Output : Saturation 3.86s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
? [X0,X1] :
! [X2] :
( big_f(X0,X2)
=> ( ( ( big_f(X2,X2)
=> big_g(X2,X2) )
<=> big_f(X0,X1) )
=> ( ( ( big_g(X2,X2)
=> big_f(X2,X2) )
<=> big_g(X0,X1) )
=> ( ( ( big_g(X0,X1)
=> big_f(X1,X0) )
<=> big_g(X1,X2) )
=> ( big_f(X2,X1)
<=> big_f(X1,X0) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_14_7) ).
fof(f2,negated_conjecture,
~ ? [X0,X1] :
! [X2] :
( big_f(X0,X2)
=> ( ( ( big_f(X2,X2)
=> big_g(X2,X2) )
<=> big_f(X0,X1) )
=> ( ( ( big_g(X2,X2)
=> big_f(X2,X2) )
<=> big_g(X0,X1) )
=> ( ( ( big_g(X0,X1)
=> big_f(X1,X0) )
<=> big_g(X1,X2) )
=> ( big_f(X2,X1)
<=> big_f(X1,X0) ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
! [X0,X1] :
? [X2] :
( ( big_f(X2,X1)
<~> big_f(X1,X0) )
& ( ( big_f(X1,X0)
| ~ big_g(X0,X1) )
<=> big_g(X1,X2) )
& ( ( big_f(X2,X2)
| ~ big_g(X2,X2) )
<=> big_g(X0,X1) )
& ( ( big_g(X2,X2)
| ~ big_f(X2,X2) )
<=> big_f(X0,X1) )
& big_f(X0,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
! [X0,X1] :
? [X2] :
( ( big_f(X2,X1)
<~> big_f(X1,X0) )
& ( ( big_f(X1,X0)
| ~ big_g(X0,X1) )
<=> big_g(X1,X2) )
& ( ( big_f(X2,X2)
| ~ big_g(X2,X2) )
<=> big_g(X0,X1) )
& ( ( big_g(X2,X2)
| ~ big_f(X2,X2) )
<=> big_f(X0,X1) )
& big_f(X0,X2) ),
inference(flattening,[],[f3]) ).
fof(f5,plain,
! [X0,X1] :
? [X2] :
( ( ~ big_f(X1,X0)
| ~ big_f(X2,X1) )
& ( big_f(X1,X0)
| big_f(X2,X1) )
& ( big_f(X1,X0)
| ~ big_g(X0,X1)
| ~ big_g(X1,X2) )
& ( big_g(X1,X2)
| ( ~ big_f(X1,X0)
& big_g(X0,X1) ) )
& ( big_f(X2,X2)
| ~ big_g(X2,X2)
| ~ big_g(X0,X1) )
& ( big_g(X0,X1)
| ( ~ big_f(X2,X2)
& big_g(X2,X2) ) )
& ( big_g(X2,X2)
| ~ big_f(X2,X2)
| ~ big_f(X0,X1) )
& ( big_f(X0,X1)
| ( ~ big_g(X2,X2)
& big_f(X2,X2) ) )
& big_f(X0,X2) ),
inference(nnf_transformation,[],[f4]) ).
fof(f6,plain,
! [X0,X1] :
? [X2] :
( ( ~ big_f(X1,X0)
| ~ big_f(X2,X1) )
& ( big_f(X1,X0)
| big_f(X2,X1) )
& ( big_f(X1,X0)
| ~ big_g(X0,X1)
| ~ big_g(X1,X2) )
& ( big_g(X1,X2)
| ( ~ big_f(X1,X0)
& big_g(X0,X1) ) )
& ( big_f(X2,X2)
| ~ big_g(X2,X2)
| ~ big_g(X0,X1) )
& ( big_g(X0,X1)
| ( ~ big_f(X2,X2)
& big_g(X2,X2) ) )
& ( big_g(X2,X2)
| ~ big_f(X2,X2)
| ~ big_f(X0,X1) )
& ( big_f(X0,X1)
| ( ~ big_g(X2,X2)
& big_f(X2,X2) ) )
& big_f(X0,X2) ),
inference(flattening,[],[f5]) ).
fof(f7,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ big_f(X1,X0)
| ~ big_f(X2,X1) )
& ( big_f(X1,X0)
| big_f(X2,X1) )
& ( big_f(X1,X0)
| ~ big_g(X0,X1)
| ~ big_g(X1,X2) )
& ( big_g(X1,X2)
| ( ~ big_f(X1,X0)
& big_g(X0,X1) ) )
& ( big_f(X2,X2)
| ~ big_g(X2,X2)
| ~ big_g(X0,X1) )
& ( big_g(X0,X1)
| ( ~ big_f(X2,X2)
& big_g(X2,X2) ) )
& ( big_g(X2,X2)
| ~ big_f(X2,X2)
| ~ big_f(X0,X1) )
& ( big_f(X0,X1)
| ( ~ big_g(X2,X2)
& big_f(X2,X2) ) )
& big_f(X0,X2) )
=> ( ( ~ big_f(X1,X0)
| ~ big_f(sK0(X0,X1),X1) )
& ( big_f(X1,X0)
| big_f(sK0(X0,X1),X1) )
& ( big_f(X1,X0)
| ~ big_g(X0,X1)
| ~ big_g(X1,sK0(X0,X1)) )
& ( big_g(X1,sK0(X0,X1))
| ( ~ big_f(X1,X0)
& big_g(X0,X1) ) )
& ( big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_g(sK0(X0,X1),sK0(X0,X1))
| ~ big_g(X0,X1) )
& ( big_g(X0,X1)
| ( ~ big_f(sK0(X0,X1),sK0(X0,X1))
& big_g(sK0(X0,X1),sK0(X0,X1)) ) )
& ( big_g(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(X0,X1) )
& ( big_f(X0,X1)
| ( ~ big_g(sK0(X0,X1),sK0(X0,X1))
& big_f(sK0(X0,X1),sK0(X0,X1)) ) )
& big_f(X0,sK0(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X0,X1] :
( ( ~ big_f(X1,X0)
| ~ big_f(sK0(X0,X1),X1) )
& ( big_f(X1,X0)
| big_f(sK0(X0,X1),X1) )
& ( big_f(X1,X0)
| ~ big_g(X0,X1)
| ~ big_g(X1,sK0(X0,X1)) )
& ( big_g(X1,sK0(X0,X1))
| ( ~ big_f(X1,X0)
& big_g(X0,X1) ) )
& ( big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_g(sK0(X0,X1),sK0(X0,X1))
| ~ big_g(X0,X1) )
& ( big_g(X0,X1)
| ( ~ big_f(sK0(X0,X1),sK0(X0,X1))
& big_g(sK0(X0,X1),sK0(X0,X1)) ) )
& ( big_g(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(X0,X1) )
& ( big_f(X0,X1)
| ( ~ big_g(sK0(X0,X1),sK0(X0,X1))
& big_f(sK0(X0,X1),sK0(X0,X1)) ) )
& big_f(X0,sK0(X0,X1)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).
fof(f9,plain,
! [X0,X1] : big_f(X0,sK0(X0,X1)),
inference(cnf_transformation,[],[f8]) ).
fof(f10,plain,
! [X0,X1] :
( big_f(X0,X1)
| big_f(sK0(X0,X1),sK0(X0,X1)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f11,plain,
! [X0,X1] :
( big_f(X0,X1)
| ~ big_g(sK0(X0,X1),sK0(X0,X1)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f12,plain,
! [X0,X1] :
( big_g(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f13,plain,
! [X0,X1] :
( big_g(X0,X1)
| big_g(sK0(X0,X1),sK0(X0,X1)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f14,plain,
! [X0,X1] :
( big_g(X0,X1)
| ~ big_f(sK0(X0,X1),sK0(X0,X1)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f15,plain,
! [X0,X1] :
( big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_g(sK0(X0,X1),sK0(X0,X1))
| ~ big_g(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f16,plain,
! [X0,X1] :
( big_g(X1,sK0(X0,X1))
| big_g(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f17,plain,
! [X0,X1] :
( big_g(X1,sK0(X0,X1))
| ~ big_f(X1,X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f18,plain,
! [X0,X1] :
( big_f(X1,X0)
| ~ big_g(X0,X1)
| ~ big_g(X1,sK0(X0,X1)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f19,plain,
! [X0,X1] :
( big_f(X1,X0)
| big_f(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f20,plain,
! [X0,X1] :
( ~ big_f(X1,X0)
| ~ big_f(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f8]) ).
cnf(c_49,negated_conjecture,
( ~ big_f(sK0(X0,X1),X1)
| ~ big_f(X1,X0) ),
inference(cnf_transformation,[],[f20]) ).
cnf(c_50,negated_conjecture,
( big_f(sK0(X0,X1),X1)
| big_f(X1,X0) ),
inference(cnf_transformation,[],[f19]) ).
cnf(c_51,negated_conjecture,
( ~ big_g(X0,sK0(X1,X0))
| ~ big_g(X1,X0)
| big_f(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
cnf(c_52,negated_conjecture,
( ~ big_f(X0,X1)
| big_g(X0,sK0(X1,X0)) ),
inference(cnf_transformation,[],[f17]) ).
cnf(c_53,negated_conjecture,
( big_g(X0,sK0(X1,X0))
| big_g(X1,X0) ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_54,negated_conjecture,
( ~ big_g(sK0(X0,X1),sK0(X0,X1))
| ~ big_g(X0,X1)
| big_f(sK0(X0,X1),sK0(X0,X1)) ),
inference(cnf_transformation,[],[f15]) ).
cnf(c_55,negated_conjecture,
( ~ big_f(sK0(X0,X1),sK0(X0,X1))
| big_g(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
cnf(c_56,negated_conjecture,
( big_g(sK0(X0,X1),sK0(X0,X1))
| big_g(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_57,negated_conjecture,
( ~ big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(X0,X1)
| big_g(sK0(X0,X1),sK0(X0,X1)) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_58,negated_conjecture,
( ~ big_g(sK0(X0,X1),sK0(X0,X1))
| big_f(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_59,negated_conjecture,
( big_f(sK0(X0,X1),sK0(X0,X1))
| big_f(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_60,negated_conjecture,
big_f(X0,sK0(X0,X1)),
inference(cnf_transformation,[],[f9]) ).
cnf(c_183,plain,
( ~ big_f(sK0(sK0(X0,X1),sK0(X0,X1)),sK0(sK0(X0,X1),sK0(X0,X1)))
| big_g(sK0(X0,X1),sK0(X0,X1)) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_187,plain,
( big_f(sK0(sK0(X0,X1),sK0(X0,X1)),sK0(sK0(X0,X1),sK0(X0,X1)))
| big_f(sK0(X0,X1),sK0(X0,X1)) ),
inference(instantiation,[status(thm)],[c_59]) ).
cnf(c_410,plain,
( big_f(X0,X1)
| big_g(X0,X1) ),
inference(superposition,[status(thm)],[c_59,c_55]) ).
cnf(c_468,plain,
( ~ big_g(X0,X1)
| big_f(X1,sK0(X0,X1))
| big_f(X1,X0) ),
inference(superposition,[status(thm)],[c_410,c_51]) ).
cnf(c_505,negated_conjecture,
( ~ big_g(X0,X1)
| big_f(sK0(X0,X1),sK0(X0,X1)) ),
inference(global_subsumption_just,[status(thm)],[c_54,c_54,c_183,c_187]) ).
cnf(c_529,negated_conjecture,
( ~ big_f(X0,X1)
| big_g(sK0(X0,X1),sK0(X0,X1)) ),
inference(global_subsumption_just,[status(thm)],[c_57,c_56,c_57,c_505]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN335+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13 % Command : run_iprover %s %d SAT
% 0.13/0.35 % Computer : n010.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 17:30:50 EDT 2023
% 0.20/0.35 % CPUTime :
% 0.20/0.47 Running model finding
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --no_cores 8 --heuristic_context fnt --schedule fnt_schedule /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.86/1.14 % SZS status Started for theBenchmark.p
% 3.86/1.14 % SZS status CounterSatisfiable for theBenchmark.p
% 3.86/1.14
% 3.86/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.86/1.14
% 3.86/1.14 ------ iProver source info
% 3.86/1.14
% 3.86/1.14 git: date: 2023-05-31 18:12:56 +0000
% 3.86/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.86/1.14 git: non_committed_changes: false
% 3.86/1.14 git: last_make_outside_of_git: false
% 3.86/1.14
% 3.86/1.14 ------ Parsing...
% 3.86/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.86/1.14
% 3.86/1.14 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 3.86/1.14
% 3.86/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.86/1.14 ------ Proving...
% 3.86/1.14 ------ Problem Properties
% 3.86/1.14
% 3.86/1.14
% 3.86/1.14 clauses 12
% 3.86/1.14 conjectures 12
% 3.86/1.14 EPR 0
% 3.86/1.14 Horn 8
% 3.86/1.14 unary 1
% 3.86/1.14 binary 8
% 3.86/1.14 lits 26
% 3.86/1.14 lits eq 0
% 3.86/1.14 fd_pure 0
% 3.86/1.14 fd_pseudo 0
% 3.86/1.14 fd_cond 0
% 3.86/1.14 fd_pseudo_cond 0
% 3.86/1.14 AC symbols 0
% 3.86/1.14
% 3.86/1.14 ------ Schedule dynamic 5 is on
% 3.86/1.14
% 3.86/1.14 ------ no equalities: superposition off
% 3.86/1.14
% 3.86/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.86/1.14
% 3.86/1.14
% 3.86/1.14 ------
% 3.86/1.14 Current options:
% 3.86/1.14 ------
% 3.86/1.14
% 3.86/1.14
% 3.86/1.14
% 3.86/1.14
% 3.86/1.14 ------ Proving...
% 3.86/1.14
% 3.86/1.14
% 3.86/1.14 % SZS status CounterSatisfiable for theBenchmark.p
% 3.86/1.14
% 3.86/1.14 % SZS output start Saturation for theBenchmark.p
% See solution above
% 3.86/1.15
% 3.86/1.15 ------ Statistics
% 3.86/1.15
% 3.86/1.15 ------ Problem properties
% 3.86/1.15
% 3.86/1.15 clauses: 12
% 3.86/1.15 conjectures: 12
% 3.86/1.15 epr: 0
% 3.86/1.15 horn: 8
% 3.86/1.15 ground: 0
% 3.86/1.15 unary: 1
% 3.86/1.15 binary: 8
% 3.86/1.15 lits: 26
% 3.86/1.15 lits_eq: 0
% 3.86/1.15 fd_pure: 0
% 3.86/1.15 fd_pseudo: 0
% 3.86/1.15 fd_cond: 0
% 3.86/1.15 fd_pseudo_cond: 0
% 3.86/1.15 ac_symbols: 0
% 3.86/1.15
% 3.86/1.15 ------ General
% 3.86/1.15
% 3.86/1.15 abstr_ref_over_cycles: 0
% 3.86/1.15 abstr_ref_under_cycles: 0
% 3.86/1.15 gc_basic_clause_elim: 0
% 3.86/1.15 num_of_symbols: 99
% 3.86/1.15 num_of_terms: 429
% 3.86/1.15
% 3.86/1.15 parsing_time: 0.009
% 3.86/1.15 unif_index_cands_time: 0.
% 3.86/1.15 unif_index_add_time: 0.
% 3.86/1.15 orderings_time: 0.
% 3.86/1.15 out_proof_time: 0.001
% 3.86/1.15 total_time: 0.119
% 3.86/1.15
% 3.86/1.15 ------ Preprocessing
% 3.86/1.15
% 3.86/1.15 num_of_splits: 0
% 3.86/1.15 num_of_split_atoms: 0
% 3.86/1.15 num_of_reused_defs: 0
% 3.86/1.15 num_eq_ax_congr_red: 0
% 3.86/1.15 num_of_sem_filtered_clauses: 0
% 3.86/1.15 num_of_subtypes: 0
% 3.86/1.15 monotx_restored_types: 0
% 3.86/1.15 sat_num_of_epr_types: 0
% 3.86/1.15 sat_num_of_non_cyclic_types: 0
% 3.86/1.15 sat_guarded_non_collapsed_types: 0
% 3.86/1.15 num_pure_diseq_elim: 0
% 3.86/1.15 simp_replaced_by: 0
% 3.86/1.15 res_preprocessed: 0
% 3.86/1.15 sup_preprocessed: 0
% 3.86/1.15 prep_upred: 0
% 3.86/1.15 prep_unflattend: 0
% 3.86/1.15 prep_well_definedness: 0
% 3.86/1.15 smt_new_axioms: 0
% 3.86/1.15 pred_elim_cands: 2
% 3.86/1.15 pred_elim: 0
% 3.86/1.15 pred_elim_cl: 0
% 3.86/1.15 pred_elim_cycles: 1
% 3.86/1.15 merged_defs: 2
% 3.86/1.15 merged_defs_ncl: 0
% 3.86/1.15 bin_hyper_res: 2
% 3.86/1.15 prep_cycles: 1
% 3.86/1.15
% 3.86/1.15 splitting_time: 0.
% 3.86/1.15 sem_filter_time: 0.
% 3.86/1.15 monotx_time: 0.
% 3.86/1.15 subtype_inf_time: 0.
% 3.86/1.15 res_prep_time: 0.005
% 3.86/1.15 sup_prep_time: 0.
% 3.86/1.15 pred_elim_time: 0.
% 3.86/1.15 bin_hyper_res_time: 0.
% 3.86/1.15 prep_time_total: 0.006
% 3.86/1.15
% 3.86/1.15 ------ Propositional Solver
% 3.86/1.15
% 3.86/1.15 prop_solver_calls: 9
% 3.86/1.15 prop_fast_solver_calls: 148
% 3.86/1.15 smt_solver_calls: 0
% 3.86/1.15 smt_fast_solver_calls: 0
% 3.86/1.15 prop_num_of_clauses: 165
% 3.86/1.15 prop_preprocess_simplified: 523
% 3.86/1.15 prop_fo_subsumed: 4
% 3.86/1.15
% 3.86/1.15 prop_solver_time: 0.
% 3.86/1.15 prop_fast_solver_time: 0.
% 3.86/1.15 prop_unsat_core_time: 0.
% 3.86/1.15 smt_solver_time: 0.
% 3.86/1.15 smt_fast_solver_time: 0.
% 3.86/1.15
% 3.86/1.15 ------ QBF
% 3.86/1.15
% 3.86/1.15 qbf_q_res: 0
% 3.86/1.15 qbf_num_tautologies: 0
% 3.86/1.15 qbf_prep_cycles: 0
% 3.86/1.15
% 3.86/1.15 ------ BMC1
% 3.86/1.15
% 3.86/1.15 bmc1_current_bound: -1
% 3.86/1.15 bmc1_last_solved_bound: -1
% 3.86/1.15 bmc1_unsat_core_size: -1
% 3.86/1.15 bmc1_unsat_core_parents_size: -1
% 3.86/1.15 bmc1_merge_next_fun: 0
% 3.86/1.15
% 3.86/1.15 bmc1_unsat_core_clauses_time: 0.
% 3.86/1.15
% 3.86/1.15 ------ Instantiation
% 3.86/1.15
% 3.86/1.15 inst_num_of_clauses: 80
% 3.86/1.15 inst_num_in_passive: 8
% 3.86/1.15 inst_num_in_active: 45
% 3.86/1.15 inst_num_of_loops: 87
% 3.86/1.15 inst_num_in_unprocessed: 27
% 3.86/1.15 inst_num_of_learning_restarts: 0
% 3.86/1.15 inst_num_moves_active_passive: 38
% 3.86/1.15 inst_lit_activity: 0
% 3.86/1.15 inst_lit_activity_moves: 0
% 3.86/1.15 inst_num_tautologies: 0
% 3.86/1.15 inst_num_prop_implied: 0
% 3.86/1.15 inst_num_existing_simplified: 0
% 3.86/1.15 inst_num_eq_res_simplified: 0
% 3.86/1.15 inst_num_child_elim: 0
% 3.86/1.15 inst_num_of_dismatching_blockings: 30
% 3.86/1.15 inst_num_of_non_proper_insts: 110
% 3.86/1.15 inst_num_of_duplicates: 0
% 3.86/1.15 inst_inst_num_from_inst_to_res: 0
% 3.86/1.15
% 3.86/1.15 inst_time_sim_new: 0.002
% 3.86/1.15 inst_time_sim_given: 0.
% 3.86/1.15 inst_time_dismatching_checking: 0.
% 3.86/1.15 inst_time_total: 0.007
% 3.86/1.15
% 3.86/1.15 ------ Resolution
% 3.86/1.15
% 3.86/1.15 res_num_of_clauses: 12
% 3.86/1.15 res_num_in_passive: 0
% 3.86/1.15 res_num_in_active: 0
% 3.86/1.15 res_num_of_loops: 13
% 3.86/1.15 res_forward_subset_subsumed: 1
% 3.86/1.15 res_backward_subset_subsumed: 0
% 3.86/1.15 res_forward_subsumed: 0
% 3.86/1.15 res_backward_subsumed: 0
% 3.86/1.15 res_forward_subsumption_resolution: 0
% 3.86/1.15 res_backward_subsumption_resolution: 0
% 3.86/1.15 res_clause_to_clause_subsumption: 98
% 3.86/1.15 res_subs_bck_cnt: 2
% 3.86/1.15 res_orphan_elimination: 0
% 3.86/1.15 res_tautology_del: 2
% 3.86/1.15 res_num_eq_res_simplified: 0
% 3.86/1.15 res_num_sel_changes: 0
% 3.86/1.15 res_moves_from_active_to_pass: 0
% 3.86/1.15
% 3.86/1.15 res_time_sim_new: 0.
% 3.86/1.15 res_time_sim_fw_given: 0.
% 3.86/1.15 res_time_sim_bw_given: 0.
% 3.86/1.15 res_time_total: 0.004
% 3.86/1.15
% 3.86/1.15 ------ Superposition
% 3.86/1.15
% 3.86/1.15 sup_num_of_clauses: 16
% 3.86/1.15 sup_num_in_active: 14
% 3.86/1.15 sup_num_in_passive: 2
% 3.86/1.15 sup_num_of_loops: 28
% 3.86/1.15 sup_fw_superposition: 14
% 3.86/1.15 sup_bw_superposition: 4
% 3.86/1.15 sup_eq_factoring: 0
% 3.86/1.15 sup_eq_resolution: 0
% 3.86/1.15 sup_immediate_simplified: 0
% 3.86/1.15 sup_given_eliminated: 0
% 3.86/1.15 comparisons_done: 20
% 3.86/1.15 comparisons_avoided: 0
% 3.86/1.15 comparisons_inc_criteria: 0
% 3.86/1.15 sup_deep_cl_discarded: 0
% 3.86/1.15 sup_num_of_deepenings: 0
% 3.86/1.15 sup_num_of_restarts: 0
% 3.86/1.15
% 3.86/1.15 sup_time_generating: 0.
% 3.86/1.15 sup_time_sim_fw_full: 0.
% 3.86/1.15 sup_time_sim_bw_full: 0.062
% 3.86/1.15 sup_time_sim_fw_immed: 0.
% 3.86/1.15 sup_time_sim_bw_immed: 0.
% 3.86/1.15 sup_time_prep_sim_fw_input: 0.
% 3.86/1.15 sup_time_prep_sim_bw_input: 0.
% 3.86/1.15 sup_time_total: 0.065
% 3.86/1.15
% 3.86/1.15 ------ Simplifications
% 3.86/1.15
% 3.86/1.15 sim_repeated: 4
% 3.86/1.15 sim_fw_subset_subsumed: 0
% 3.86/1.15 sim_bw_subset_subsumed: 0
% 3.86/1.15 sim_fw_subsumed: 0
% 3.86/1.15 sim_bw_subsumed: 0
% 3.86/1.15 sim_fw_subsumption_res: 0
% 3.86/1.15 sim_bw_subsumption_res: 0
% 3.86/1.15 sim_fw_unit_subs: 0
% 3.86/1.15 sim_bw_unit_subs: 0
% 3.86/1.15 sim_tautology_del: 10
% 3.86/1.15 sim_eq_tautology_del: 0
% 3.86/1.15 sim_eq_res_simp: 0
% 3.86/1.15 sim_fw_demodulated: 0
% 3.86/1.15 sim_bw_demodulated: 0
% 3.86/1.15 sim_encompassment_demod: 0
% 3.86/1.15 sim_light_normalised: 0
% 3.86/1.15 sim_ac_normalised: 0
% 3.86/1.15 sim_joinable_taut: 0
% 3.86/1.15 sim_joinable_simp: 0
% 3.86/1.15 sim_fw_ac_demod: 0
% 3.86/1.15 sim_bw_ac_demod: 0
% 3.86/1.15 sim_smt_subsumption: 0
% 3.86/1.15 sim_smt_simplified: 0
% 3.86/1.15 sim_ground_joinable: 0
% 3.86/1.15 sim_bw_ground_joinable: 0
% 3.86/1.15 sim_connectedness: 0
% 3.86/1.15
% 3.86/1.15 sim_time_fw_subset_subs: 0.
% 3.86/1.15 sim_time_bw_subset_subs: 0.
% 3.86/1.15 sim_time_fw_subs: 0.
% 3.86/1.15 sim_time_bw_subs: 0.
% 3.86/1.15 sim_time_fw_subs_res: 0.
% 3.86/1.15 sim_time_bw_subs_res: 0.
% 3.86/1.15 sim_time_fw_unit_subs: 0.
% 3.86/1.15 sim_time_bw_unit_subs: 0.
% 3.86/1.15 sim_time_tautology_del: 0.
% 3.86/1.15 sim_time_eq_tautology_del: 0.
% 3.86/1.15 sim_time_eq_res_simp: 0.
% 3.86/1.15 sim_time_fw_demod: 0.
% 3.86/1.15 sim_time_bw_demod: 0.
% 3.86/1.15 sim_time_light_norm: 0.
% 3.86/1.15 sim_time_joinable: 0.
% 3.86/1.15 sim_time_ac_norm: 0.
% 3.86/1.15 sim_time_fw_ac_demod: 0.
% 3.86/1.15 sim_time_bw_ac_demod: 0.
% 3.86/1.15 sim_time_smt_subs: 0.
% 3.86/1.15 sim_time_fw_gjoin: 0.
% 3.86/1.15 sim_time_fw_connected: 0.
% 3.86/1.15
% 3.86/1.15
%------------------------------------------------------------------------------