%------------------------------------------------------------------------------
% File : iProver-SAT---3.9.4
% Problem : KRS030+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p SAT
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 01:54:36 PM UTC 2026
% Result : Satisfiable 0.41s 1.19s
% Output : Saturation 0.41s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f19,axiom,
! [X0] :
( ~ cowlNothing(X0)
& cowlThing(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_0) ).
fof(f20,axiom,
! [X0] :
( xsd_string(X0)
<=> ~ xsd_integer(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).
fof(f21,axiom,
! [X0] :
( cSatisfiable(X0)
<=> ( ? [X1] :
( cp(X1)
& rf(X0,X1) )
& ? [X1] :
( ~ cp(X1)
& rf1(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f22,axiom,
! [X0,X1,X2] :
( ( rf(X0,X2)
& rf(X0,X1) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f23,axiom,
! [X0,X1,X2] :
( ( rf1(X0,X2)
& rf1(X0,X1) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(f24,axiom,
! [X0,X1] :
( rinvF(X0,X1)
<=> rf(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(f25,axiom,
! [X0,X1] :
( rinvF1(X0,X1)
<=> rf1(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(f26,axiom,
! [X0,X1] :
( rinvS(X0,X1)
<=> rs(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
fof(f27,axiom,
! [X0,X1,X2] :
( ( rs(X0,X2)
& rs(X0,X1) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
fof(f28,axiom,
cSatisfiable(i2003_11_14_17_15_26245),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).
fof(f29,axiom,
! [X0,X1] :
( rs(X0,X1)
=> rf(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_10) ).
fof(f30,axiom,
! [X0,X1] :
( rs(X0,X1)
=> rf1(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_11) ).
fof(f31,plain,
! [X0] :
( cSatisfiable(X0)
<=> ( ? [X2] :
( cp(X2)
& rf(X0,X2) )
& ? [X1] :
( ~ cp(X1)
& rf1(X0,X1) ) ) ),
inference(rectify,[],[f21]) ).
fof(f68,plain,
! [X0,X1,X2] :
( ~ rf(X0,X2)
| ~ rf(X0,X1)
| X1 = X2 ),
inference(ennf_transformation,[],[f22]) ).
fof(f69,plain,
! [X0,X1,X2] :
( ~ rf(X0,X2)
| ~ rf(X0,X1)
| X1 = X2 ),
inference(flattening,[],[f68]) ).
fof(f70,plain,
! [X0,X1,X2] :
( ~ rf1(X0,X2)
| ~ rf1(X0,X1)
| X1 = X2 ),
inference(ennf_transformation,[],[f23]) ).
fof(f71,plain,
! [X0,X1,X2] :
( ~ rf1(X0,X2)
| ~ rf1(X0,X1)
| X1 = X2 ),
inference(flattening,[],[f70]) ).
fof(f72,plain,
! [X0,X1,X2] :
( ~ rs(X0,X2)
| ~ rs(X0,X1)
| X1 = X2 ),
inference(ennf_transformation,[],[f27]) ).
fof(f73,plain,
! [X0,X1,X2] :
( ~ rs(X0,X2)
| ~ rs(X0,X1)
| X1 = X2 ),
inference(flattening,[],[f72]) ).
fof(f74,plain,
! [X0,X1] :
( ~ rs(X0,X1)
| rf(X0,X1) ),
inference(ennf_transformation,[],[f29]) ).
fof(f75,plain,
! [X0,X1] :
( ~ rs(X0,X1)
| rf1(X0,X1) ),
inference(ennf_transformation,[],[f30]) ).
fof(f76,plain,
! [X0] :
( ( ~ xsd_string(X0)
| ~ xsd_integer(X0) )
& ( xsd_integer(X0)
| xsd_string(X0) ) ),
inference(nnf_transformation,[],[f20]) ).
fof(f77,plain,
! [X0] :
( ( ~ cSatisfiable(X0)
| ( ? [X2] :
( cp(X2)
& rf(X0,X2) )
& ? [X1] :
( ~ cp(X1)
& rf1(X0,X1) ) ) )
& ( ! [X2] :
( ~ cp(X2)
| ~ rf(X0,X2) )
| ! [X1] :
( cp(X1)
| ~ rf1(X0,X1) )
| cSatisfiable(X0) ) ),
inference(nnf_transformation,[],[f31]) ).
fof(f78,plain,
! [X0] :
( ( ~ cSatisfiable(X0)
| ( ? [X2] :
( cp(X2)
& rf(X0,X2) )
& ? [X1] :
( ~ cp(X1)
& rf1(X0,X1) ) ) )
& ( ! [X2] :
( ~ cp(X2)
| ~ rf(X0,X2) )
| ! [X1] :
( cp(X1)
| ~ rf1(X0,X1) )
| cSatisfiable(X0) ) ),
inference(flattening,[],[f77]) ).
fof(f79,plain,
! [X0] :
( ( ~ cSatisfiable(X0)
| ( ? [X4] :
( cp(X4)
& rf(X0,X4) )
& ? [X3] :
( ~ cp(X3)
& rf1(X0,X3) ) ) )
& ( ! [X2] :
( ~ cp(X2)
| ~ rf(X0,X2) )
| ! [X1] :
( cp(X1)
| ~ rf1(X0,X1) )
| cSatisfiable(X0) ) ),
inference(rectify,[],[f78]) ).
fof(f80,plain,
! [X0] :
( ( ~ cSatisfiable(X0)
| ( cp(sK1(X0))
& rf(X0,sK1(X0))
& ~ cp(sK0(X0))
& rf1(X0,sK0(X0)) ) )
& ( ! [X2] :
( ~ cp(X2)
| ~ rf(X0,X2) )
| ! [X1] :
( cp(X1)
| ~ rf1(X0,X1) )
| cSatisfiable(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X3,sK0(X0)),skolemize(X4,sK1(X0))],[f79]) ).
fof(f81,plain,
! [X0,X1] :
( ( ~ rinvF(X0,X1)
| rf(X1,X0) )
& ( ~ rf(X1,X0)
| rinvF(X0,X1) ) ),
inference(nnf_transformation,[],[f24]) ).
fof(f82,plain,
! [X0,X1] :
( ( ~ rinvF1(X0,X1)
| rf1(X1,X0) )
& ( ~ rf1(X1,X0)
| rinvF1(X0,X1) ) ),
inference(nnf_transformation,[],[f25]) ).
fof(f83,plain,
! [X0,X1] :
( ( ~ rinvS(X0,X1)
| rs(X1,X0) )
& ( ~ rs(X1,X0)
| rinvS(X0,X1) ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f102,plain,
! [X0] : ~ cowlNothing(X0),
inference(cnf_transformation,[],[f19]) ).
fof(f103,plain,
! [X0] : cowlThing(X0),
inference(cnf_transformation,[],[f19]) ).
fof(f104,plain,
! [X0] :
( ~ xsd_string(X0)
| ~ xsd_integer(X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f105,plain,
! [X0] :
( xsd_integer(X0)
| xsd_string(X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f106,plain,
! [X0] :
( ~ cSatisfiable(X0)
| cp(sK1(X0)) ),
inference(cnf_transformation,[],[f80]) ).
fof(f107,plain,
! [X0] :
( ~ cSatisfiable(X0)
| rf(X0,sK1(X0)) ),
inference(cnf_transformation,[],[f80]) ).
fof(f108,plain,
! [X0] :
( ~ cSatisfiable(X0)
| ~ cp(sK0(X0)) ),
inference(cnf_transformation,[],[f80]) ).
fof(f109,plain,
! [X0] :
( ~ cSatisfiable(X0)
| rf1(X0,sK0(X0)) ),
inference(cnf_transformation,[],[f80]) ).
fof(f110,plain,
! [X2,X0,X1] :
( ~ cp(X2)
| ~ rf(X0,X2)
| cp(X1)
| ~ rf1(X0,X1)
| cSatisfiable(X0) ),
inference(cnf_transformation,[],[f80]) ).
fof(f111,plain,
! [X2,X0,X1] :
( ~ rf(X0,X2)
| ~ rf(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f69]) ).
fof(f112,plain,
! [X2,X0,X1] :
( ~ rf1(X0,X2)
| ~ rf1(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f71]) ).
fof(f113,plain,
! [X0,X1] :
( ~ rinvF(X0,X1)
| rf(X1,X0) ),
inference(cnf_transformation,[],[f81]) ).
fof(f114,plain,
! [X0,X1] :
( ~ rf(X1,X0)
| rinvF(X0,X1) ),
inference(cnf_transformation,[],[f81]) ).
fof(f115,plain,
! [X0,X1] :
( ~ rinvF1(X0,X1)
| rf1(X1,X0) ),
inference(cnf_transformation,[],[f82]) ).
fof(f116,plain,
! [X0,X1] :
( ~ rf1(X1,X0)
| rinvF1(X0,X1) ),
inference(cnf_transformation,[],[f82]) ).
fof(f117,plain,
! [X0,X1] :
( ~ rinvS(X0,X1)
| rs(X1,X0) ),
inference(cnf_transformation,[],[f83]) ).
fof(f118,plain,
! [X0,X1] :
( ~ rs(X1,X0)
| rinvS(X0,X1) ),
inference(cnf_transformation,[],[f83]) ).
fof(f119,plain,
! [X2,X0,X1] :
( ~ rs(X0,X2)
| ~ rs(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f73]) ).
fof(f120,plain,
cSatisfiable(i2003_11_14_17_15_26245),
inference(cnf_transformation,[],[f28]) ).
fof(f121,plain,
! [X0,X1] :
( ~ rs(X0,X1)
| rf(X0,X1) ),
inference(cnf_transformation,[],[f74]) ).
fof(f122,plain,
! [X0,X1] :
( ~ rs(X0,X1)
| rf1(X0,X1) ),
inference(cnf_transformation,[],[f75]) ).
tcf(c_49,plain,
! [X0: $i] : cowlThing(X0),
inference(cnf_transformation,[],[f103]) ).
tcf(c_50,plain,
! [X0: $i] : ~ cowlNothing(X0),
inference(cnf_transformation,[],[f102]) ).
tcf(c_51,plain,
! [X0: $i] :
( xsd_integer(X0)
| xsd_string(X0) ),
inference(cnf_transformation,[],[f105]) ).
tcf(c_52,plain,
! [X0: $i] :
( ~ xsd_integer(X0)
| ~ xsd_string(X0) ),
inference(cnf_transformation,[],[f104]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] :
( cp(X1)
| cSatisfiable(X0)
| ~ cp(X2)
| ~ rf(X0,X2)
| ~ rf1(X0,X1) ),
inference(cnf_transformation,[],[f110]) ).
tcf(c_54,plain,
! [X0: $i] :
( rf1(X0,sK0(X0))
| ~ cSatisfiable(X0) ),
inference(cnf_transformation,[],[f109]) ).
tcf(c_55,plain,
! [X0: $i] :
( ~ cSatisfiable(X0)
| ~ cp(sK0(X0)) ),
inference(cnf_transformation,[],[f108]) ).
tcf(c_56,plain,
! [X0: $i] :
( rf(X0,sK1(X0))
| ~ cSatisfiable(X0) ),
inference(cnf_transformation,[],[f107]) ).
tcf(c_57,plain,
! [X0: $i] :
( cp(sK1(X0))
| ~ cSatisfiable(X0) ),
inference(cnf_transformation,[],[f106]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ rf(X0,X2)
| ~ rf(X0,X1) ),
inference(cnf_transformation,[],[f111]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ rf1(X0,X2)
| ~ rf1(X0,X1) ),
inference(cnf_transformation,[],[f112]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( rinvF(X1,X0)
| ~ rf(X0,X1) ),
inference(cnf_transformation,[],[f114]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] :
( rf(X1,X0)
| ~ rinvF(X0,X1) ),
inference(cnf_transformation,[],[f113]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] :
( rinvF1(X1,X0)
| ~ rf1(X0,X1) ),
inference(cnf_transformation,[],[f116]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( rf1(X1,X0)
| ~ rinvF1(X0,X1) ),
inference(cnf_transformation,[],[f115]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( rinvS(X1,X0)
| ~ rs(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] :
( rs(X1,X0)
| ~ rinvS(X0,X1) ),
inference(cnf_transformation,[],[f117]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ rs(X0,X2)
| ~ rs(X0,X1) ),
inference(cnf_transformation,[],[f119]) ).
tcf(c_67,plain,
cSatisfiable(i2003_11_14_17_15_26245),
inference(cnf_transformation,[],[f120]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] :
( rf(X0,X1)
| ~ rs(X0,X1) ),
inference(cnf_transformation,[],[f121]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i] :
( rf1(X0,X1)
| ~ rs(X0,X1) ),
inference(cnf_transformation,[],[f122]) ).
tcf(c_122,plain,
! [X0: $i] :
( rinvF(sK1(X0),X0)
| ~ cSatisfiable(X0) ),
inference(superposition,[status(thm)],[c_56,c_60]) ).
tcf(c_134,plain,
! [X0: $i] :
( rinvF1(sK0(X0),X0)
| ~ cSatisfiable(X0) ),
inference(superposition,[status(thm)],[c_54,c_62]) ).
tcf(c_174,plain,
! [X0: $i,X1: $i] :
( ( sK1(X0) = X1 )
| ~ cSatisfiable(X0)
| ~ rf(X0,X1) ),
inference(superposition,[status(thm)],[c_56,c_58]) ).
tcf(c_185,plain,
! [X0: $i,X1: $i] :
( ( sK0(X0) = X1 )
| ~ cSatisfiable(X0)
| ~ rf1(X0,X1) ),
inference(superposition,[status(thm)],[c_54,c_59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS030+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p SAT
% 0.11/0.38 % Computer : n009.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Wed Sep 23 19:16:00 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p SAT
% 0.11/0.42 Running model finding
% 0.11/0.42 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fnt_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.45 % Proving...
% 0.41/1.19 % SZS status Started for theBenchmark.p
% 0.41/1.19 % SZS status Satisfiable for theBenchmark.p
% 0.41/1.19
% 0.41/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.41/1.19
% 0.41/1.19 ------ iProver source info
% 0.41/1.19
% 0.41/1.19 git: date: 2026-07-19 20:42:38 +0200
% 0.41/1.19 git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.41/1.19 git: non_committed_changes: false
% 0.41/1.19
% 0.41/1.19 ------ Parsing...
% 0.41/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.41/1.19 ------ Proving...
% 0.41/1.19 ------ Problem Properties
% 0.41/1.19
% 0.41/1.19
% 0.41/1.19 clauses 21
% 0.41/1.19 conjectures 0
% 0.41/1.19 EPR 17
% 0.41/1.19 Horn 19
% 0.41/1.19 unary 3
% 0.41/1.19 binary 14
% 0.41/1.19 lits 45
% 0.41/1.19 lits eq 3
% 0.41/1.19 fd_pure 0
% 0.41/1.19 fd_pseudo 0
% 0.41/1.19 fd_cond 0
% 0.41/1.19 fd_pseudo_cond 3
% 0.41/1.19 AC symbols 0
% 0.41/1.19
% 0.41/1.19 ------ Schedule dynamic 5 is on
% 0.41/1.19
% 0.41/1.19 ------ no conjectures: strip conj schedule
% 0.41/1.19
% 0.41/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 0.41/1.19
% 0.41/1.19
% 0.41/1.19 ------
% 0.41/1.19 Current options:
% 0.41/1.19 ------
% 0.41/1.19
% 0.41/1.19 ------ Input Options
% 0.41/1.19
% 0.41/1.19 --out_options all
% 0.41/1.19 --tptp_safe_out true
% 0.41/1.19 --problem_path ""
% 0.41/1.19 --include_path ""
% 0.41/1.19 --clausifier res/vclausify_rel
% 0.41/1.19 --clausifier_options --mode clausify -t 101.67 -updr off
% 0.41/1.19 --stdin false
% 0.41/1.19 --proof_out true
% 0.41/1.19 --proof_dot_file ""
% 0.41/1.19 --proof_reduce_dot []
% 0.41/1.19 --suppress_sat_res false
% 0.41/1.19 --suppress_unsat_res true
% 0.41/1.19 --stats_out none
% 0.41/1.19 --stats_mem false
% 0.41/1.19 --theory_stats_out false
% 0.41/1.19
% 0.41/1.19 ------ General Options
% 0.41/1.19
% 0.41/1.19 --fof false
% 0.41/1.19 --time_out_real 305.
% 0.41/1.19 --time_out_virtual -1.
% 0.41/1.19 --rnd_seed 13
% 0.41/1.19 --symbol_type_check false
% 0.41/1.19 --clausify_out false
% 0.41/1.19 --sig_cnt_out false
% 0.41/1.19 --trig_cnt_out false
% 0.41/1.19 --trig_cnt_out_tolerance 1.
% 0.41/1.19 --trig_cnt_out_sk_spl false
% 0.41/1.19 --abstr_cl_out false
% 0.41/1.19
% 0.41/1.19 ------ Interactive Mode
% 0.41/1.19
% 0.41/1.19 --interactive_mode false
% 0.41/1.19 --external_ip_address ""
% 0.41/1.19 --external_port 0
% 0.41/1.19
% 0.41/1.19 ------ Global Options
% 0.41/1.19
% 0.41/1.19 --schedule default
% 0.41/1.19 --add_important_lit false
% 0.41/1.19 --prop_solver_per_cl 500
% 0.41/1.19 --subs_bck_mult 8
% 0.41/1.19 --min_unsat_core false
% 0.41/1.19 --soft_assumptions false
% 0.41/1.19 --soft_lemma_size 3
% 0.41/1.19 --prop_impl_unit_size 0
% 0.41/1.19 --prop_impl_unit []
% 0.41/1.19 --share_sel_clauses true
% 0.41/1.19 --reset_solvers false
% 0.41/1.19 --bc_imp_inh [conj_cone]
% 0.41/1.19 --conj_cone_tolerance 3.
% 0.41/1.19 --extra_neg_conj none
% 0.41/1.19 --large_theory_mode true
% 0.41/1.19 --prolific_symb_bound 200
% 0.41/1.19 --lt_threshold 2000
% 0.41/1.19 --clause_weak_htbl true
% 0.41/1.19 --gc_record_bc_elim false
% 0.41/1.19
% 0.41/1.19 ------ Preprocessing Options
% 0.41/1.19
% 0.41/1.19 --preprocessing_flag false
% 0.41/1.19 --time_out_prep_mult 0.1
% 0.41/1.19 --splitting_mode input
% 0.41/1.19 --splitting_grd true
% 0.41/1.19 --splitting_cvd false
% 0.41/1.19 --splitting_cvd_svl false
% 0.41/1.19 --splitting_nvd 32
% 0.41/1.19 --sub_typing false
% 0.41/1.19 --prep_eq_flat_conj false
% 0.41/1.19 --prep_ineq_split false
% 0.41/1.19 --prep_eq_flat_all_gr false
% 0.41/1.19 --prep_gs_sim true
% 0.41/1.19 --prep_unflatten true
% 0.41/1.19 --prep_res_sim true
% 0.41/1.19 --prep_sup_sim_all true
% 0.41/1.19 --prep_sup_sim_sup false
% 0.41/1.19 --prep_upred true
% 0.41/1.19 --prep_well_definedness true
% 0.41/1.19 --prep_sem_filter exhaustive
% 0.41/1.19 --prep_sem_filter_out false
% 0.41/1.19 --pred_elim true
% 0.41/1.19 --res_sim_input true
% 0.41/1.19 --eq_ax_congr_red true
% 0.41/1.19 --pure_diseq_elim true
% 0.41/1.19 --brand_transform false
% 0.41/1.19 --non_eq_to_eq false
% 0.41/1.19 --prep_eq_proxy false
% 0.41/1.19 --prep_def_merge true
% 0.41/1.19 --prep_def_merge_prop_impl false
% 0.41/1.19 --prep_def_merge_mbd true
% 0.41/1.19 --prep_def_merge_tr_red false
% 0.41/1.19 --prep_def_merge_tr_cl false
% 0.41/1.19 --smt_preprocessing false
% 0.41/1.19 --smt_ac_axioms fast
% 0.41/1.19 --preprocessed_out false
% 0.41/1.19 --preprocessed_stats false
% 0.41/1.19
% 0.41/1.19 ------ Abstraction refinement Options
% 0.41/1.19
% 0.41/1.19 --abstr_ref []
% 0.41/1.19 --abstr_ref_prep false
% 0.41/1.19 --abstr_ref_until_sat false
% 0.41/1.19 --abstr_ref_sig_restrict funpre
% 0.41/1.19 --abstr_ref_af_restrict_to_split_sk false
% 0.41/1.19 --abstr_ref_under []
% 0.41/1.19
% 0.41/1.19 ------ SAT Options
% 0.41/1.19
% 0.41/1.19 --sat_mode false
% 0.41/1.19 --sat_fm_restart_options ""
% 0.41/1.19 --sat_gr_def false
% 0.41/1.19 --sat_epr_types true
% 0.41/1.19 --sat_non_cyclic_types false
% 0.41/1.19 --sat_finite_models false
% 0.41/1.19 --sat_fm_lemmas false
% 0.41/1.19 --sat_fm_prep false
% 0.41/1.19 --sat_fm_uc_incr true
% 0.41/1.19 --sat_out_model pos
% 0.41/1.19 --sat_out_clauses false
% 0.41/1.19
% 0.41/1.19 ------ QBF Options
% 0.41/1.19
% 0.41/1.19 --qbf_mode false
% 0.41/1.19 --qbf_elim_univ false
% 0.41/1.19 --qbf_dom_inst none
% 0.41/1.19 --qbf_dom_pre_inst false
% 0.41/1.19 --qbf_sk_in false
% 0.41/1.19 --qbf_pred_elim true
% 0.41/1.19 --qbf_split 512
% 0.41/1.19
% 0.41/1.19 ------ BMC1 Options
% 0.41/1.19
% 0.41/1.19 --bmc1_incremental false
% 0.41/1.19 --bmc1_axioms reachable_all
% 0.41/1.19 --bmc1_min_bound 0
% 0.41/1.19 --bmc1_max_bound -1
% 0.41/1.19 --bmc1_max_bound_default -1
% 0.41/1.19 --bmc1_symbol_reachability true
% 0.41/1.19 --bmc1_property_lemmas false
% 0.41/1.19 --bmc1_k_induction false
% 0.41/1.19 --bmc1_non_equiv_states false
% 0.41/1.19 --bmc1_deadlock false
% 0.41/1.19 --bmc1_ucm false
% 0.41/1.19 --bmc1_add_unsat_core none
% 0.41/1.19 --bmc1_unsat_core_children false
% 0.41/1.19 --bmc1_unsat_core_extrapolate_axioms false
% 0.41/1.19 --bmc1_out_stat full
% 0.41/1.19 --bmc1_ground_init false
% 0.41/1.19 --bmc1_pre_inst_next_state false
% 0.41/1.19 --bmc1_pre_inst_state false
% 0.41/1.19 --bmc1_pre_inst_reach_state false
% 0.41/1.19 --bmc1_out_unsat_core false
% 0.41/1.19 --bmc1_aig_witness_out false
% 0.41/1.19 --bmc1_verbose false
% 0.41/1.19 --bmc1_dump_clauses_tptp false
% 0.41/1.19 --bmc1_dump_unsat_core_tptp false
% 0.41/1.19 --bmc1_dump_file -
% 0.41/1.19 --bmc1_ucm_expand_uc_limit 128
% 0.41/1.19 --bmc1_ucm_n_expand_iterations 6
% 0.41/1.19 --bmc1_ucm_extend_mode 1
% 0.41/1.19 --bmc1_ucm_init_mode 2
% 0.41/1.19 --bmc1_ucm_cone_mode none
% 0.41/1.19 --bmc1_ucm_reduced_relation_type 0
% 0.41/1.19 --bmc1_ucm_relax_model 4
% 0.41/1.19 --bmc1_ucm_full_tr_after_sat true
% 0.41/1.19 --bmc1_ucm_expand_neg_assumptions false
% 0.41/1.19 --bmc1_ucm_layered_model none
% 0.41/1.19 --bmc1_ucm_max_lemma_size 10
% 0.41/1.19
% 0.41/1.19 ------ AIG Options
% 0.41/1.19
% 0.41/1.19 --aig_mode false
% 0.41/1.19
% 0.41/1.19 ------ Instantiation Options
% 0.41/1.19
% 0.41/1.19 --instantiation_flag true
% 0.41/1.19 --inst_sos_flag false
% 0.41/1.19 --inst_sos_phase true
% 0.41/1.19 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 0.41/1.19 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.41/1.19 --inst_lit_sel_side none
% 0.41/1.19 --inst_solver_per_active 1400
% 0.41/1.19 --inst_solver_calls_frac 1.
% 0.41/1.19 --inst_to_smt_solver true
% 0.41/1.19 --inst_passive_queue_type priority_queues
% 0.41/1.19 --inst_passive_queues [[-num_var];[+age;-num_symb]]
% 0.41/1.19 --inst_passive_queues_freq [25;2]
% 0.41/1.19 --inst_dismatching true
% 0.41/1.19 --inst_eager_unprocessed_to_passive true
% 0.41/1.19 --inst_unprocessed_bound 1000
% 0.41/1.19 --inst_prop_sim_given true
% 0.41/1.19 --inst_prop_sim_new false
% 0.41/1.19 --inst_subs_new false
% 0.41/1.19 --inst_eq_res_simp false
% 0.41/1.19 --inst_subs_given false
% 0.41/1.19 --inst_orphan_elimination true
% 0.41/1.19 --inst_learning_loop_flag true
% 0.41/1.19 --inst_learning_start 3000
% 0.41/1.19 --inst_learning_factor 2
% 0.41/1.19 --inst_start_prop_sim_after_learn 3
% 0.41/1.19 --inst_sel_renew solver
% 0.41/1.19 --inst_lit_activity_flag true
% 0.41/1.19 --inst_restr_to_given false
% 0.41/1.19 --inst_activity_threshold 500
% 0.41/1.19
% 0.41/1.19 ------ Resolution Options
% 0.41/1.19
% 0.41/1.19 --resolution_flag false
% 0.41/1.19 --res_lit_sel adaptive
% 0.41/1.19 --res_lit_sel_side none
% 0.41/1.19 --res_ordering kbo
% 0.41/1.19 --res_to_prop_solver active
% 0.41/1.19 --res_prop_simpl_new false
% 0.41/1.19 --res_prop_simpl_given true
% 0.41/1.19 --res_to_smt_solver true
% 0.41/1.19 --res_passive_queue_type priority_queues
% 0.41/1.19 --res_passive_queues [[-num_symb];[+age;-num_symb]]
% 0.41/1.19 --res_passive_queues_freq [15;5]
% 0.41/1.19 --res_forward_subs full
% 0.41/1.19 --res_backward_subs full
% 0.41/1.19 --res_forward_subs_resolution true
% 0.41/1.19 --res_backward_subs_resolution true
% 0.41/1.19 --res_orphan_elimination true
% 0.41/1.19 --res_time_limit 300.
% 0.41/1.19
% 0.41/1.19 ------ Superposition Options
% 0.41/1.19
% 0.41/1.19 --superposition_flag true
% 0.41/1.19 --sup_passive_queue_type priority_queues
% 0.41/1.19 --sup_passive_queues [[-conj_dist;-num_symb];[+score;+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb];[+score;-num_symb]]
% 0.41/1.19 --sup_passive_queues_freq [8;1;4;4]
% 0.41/1.19 --twee_lhs_weight 4
% 0.41/1.19 --sup_set_join false
% 0.41/1.19 --sup_set_join_goals true
% 0.41/1.19 --sup_set_join_limit 1000
% 0.41/1.19 --demod_completeness_check fast
% 0.41/1.19 --demod_use_ground true
% 0.41/1.19 --sup_unprocessed_bound 0
% 0.41/1.19 --sup_to_prop_solver passive
% 0.41/1.19 --sup_prop_simpl_new true
% 0.41/1.19 --sup_prop_simpl_given true
% 0.41/1.19 --sup_fun_splitting false
% 0.41/1.19 --sup_iter_deepening 2
% 0.41/1.19 --sup_restarts_mult 12
% 0.41/1.19 --sup_score sim_d_gen
% 0.41/1.19 --sup_share_score_frac 0.2
% 0.41/1.19 --sup_share_max_num_cl 500
% 0.41/1.19 --sup_ordering kbo
% 0.41/1.19 --sup_symb_ordering invfreq
% 0.41/1.19 --sup_term_weight default
% 0.41/1.19
% 0.41/1.19 ------ Superposition Simplification Setup
% 0.41/1.19
% 0.41/1.19 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 0.41/1.19 --sup_full_triv [SMTSimplify;PropSubs]
% 0.41/1.19 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 0.41/1.19 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 0.41/1.19 --sup_immed_triv []
% 0.41/1.19 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 0.41/1.19 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 0.41/1.19 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 0.41/1.19 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 0.41/1.19 --sup_input_triv [Unflattening;SMTSimplify]
% 0.41/1.19 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 0.41/1.19 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 0.41/1.19 --sup_full_fixpoint true
% 0.41/1.19 --sup_main_fixpoint true
% 0.41/1.19 --sup_immed_fixpoint false
% 0.41/1.19 --sup_input_fixpoint true
% 0.41/1.19 --sup_cache_sim none
% 0.41/1.19 --sup_smt_interval 500
% 0.41/1.19 --sup_bw_gjoin_interval 0
% 0.41/1.19
% 0.41/1.19 ------ Combination Options
% 0.41/1.19
% 0.41/1.19 --comb_mode clause_based
% 0.41/1.19 --comb_inst_mult 5
% 0.41/1.19 --comb_res_mult 1
% 0.41/1.19 --comb_sup_mult 8
% 0.41/1.19 --comb_sup_deep_mult 2
% 0.41/1.19
% 0.41/1.19 ------ Debug Options
% 0.41/1.19
% 0.41/1.19 --dbg_backtrace false
% 0.41/1.19 --dbg_dump_prop_clauses false
% 0.41/1.19 --dbg_dump_prop_clauses_file -
% 0.41/1.19 --dbg_out_stat false
% 0.41/1.19 --dbg_just_parse false
% 0.41/1.19
% 0.41/1.19
% 0.41/1.19
% 0.41/1.19
% 0.41/1.19 ------ Proving...
% 0.41/1.19
% 0.41/1.19
% 0.41/1.19 % SZS status Satisfiable for theBenchmark.p
% 0.41/1.19
% 0.41/1.19 % SZS output start Saturation for theBenchmark.p
% See solution above
% 0.41/1.20
% 0.41/1.20
%------------------------------------------------------------------------------