%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL229-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n005.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 02:06:05 PM UTC 2026
% Result : Unsatisfiable 112.95s 30.09s
% Output : CNFRefutation 112.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 22
% Syntax : Number of formulae : 94 ( 61 unt; 13 def)
% Number of atoms : 252 ( 14 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 94 ( 52 ~; 42 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 17 ( 15 usr; 14 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 125 ( 0 sgn 125 !; 0 ?; 96 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
fof(f7,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( ~ theorem(X1)
| ~ theorem(implies(X1,X0))
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
fof(f9,negated_conjecture,
~ theorem(implies(implies(p,implies(q,r)),implies(implies(p,implies(r,s)),implies(p,implies(q,s))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f10,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f11,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f12,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f13,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f14,plain,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(definition_unfolding,[],[f5,f6,f6,f6]) ).
fof(f15,plain,
! [X0,X1] :
( ~ theorem(X1)
| ~ theorem(or(not(X1),X0))
| theorem(X0) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f16,plain,
~ theorem(or(not(or(not(p),or(not(q),r))),or(not(or(not(p),or(not(r),s))),or(not(p),or(not(q),s))))),
inference(definition_unfolding,[],[f9,f6,f6,f6,f6,f6,f6,f6,f6]) ).
tcf(c_58,plain,
! [X0: $i] : axiom(or(not(or(X0,X0)),X0)),
inference(cnf_transformation,[],[f10]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] : axiom(or(not(X0),or(X1,X0))),
inference(cnf_transformation,[],[f11]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(cnf_transformation,[],[f12]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(cnf_transformation,[],[f13]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(cnf_transformation,[],[f14]) ).
tcf(c_63,plain,
! [X0: $i] :
( theorem(X0)
| ~ axiom(X0) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( theorem(X1)
| ~ theorem(X0)
| ~ theorem(or(not(X0),X1)) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_65,negated_conjecture,
~ theorem(or(not(or(not(p),or(not(q),r))),or(not(or(not(p),or(not(r),s))),or(not(p),or(not(q),s))))),
inference(cnf_transformation,[],[f16]) ).
tcf(c_94,plain,
! [X0: $i] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[status(thm)],[c_63,c_58]) ).
tcf(c_99,plain,
! [X0: $i,X1: $i] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[status(thm)],[c_63,c_59]) ).
tcf(c_104,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[status(thm)],[c_63,c_60]) ).
tcf(c_109,plain,
! [X0: $i,X1: $i,X2: $i] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[status(thm)],[c_63,c_61]) ).
tcf(c_114,plain,
! [X0: $i,X1: $i,X2: $i] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[status(thm)],[c_63,c_62]) ).
tcf(c_142,definition,
iPr_def_10 = not(p),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_143,definition,
iPr_def_11 = not(q),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_144,definition,
iPr_def_12 = or(iPr_def_11,r),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_145,definition,
iPr_def_13 = or(iPr_def_10,iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_146,definition,
iPr_def_14 = not(iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_147,definition,
iPr_def_15 = not(r),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_148,definition,
iPr_def_16 = or(iPr_def_15,s),
introduced(definition,[new_symbols(definition,[iPr_def_16])],[]) ).
tcf(c_149,definition,
iPr_def_17 = or(iPr_def_10,iPr_def_16),
introduced(definition,[new_symbols(definition,[iPr_def_17])],[]) ).
tcf(c_150,definition,
iPr_def_18 = not(iPr_def_17),
introduced(definition,[new_symbols(definition,[iPr_def_18])],[]) ).
tcf(c_151,definition,
iPr_def_19 = or(iPr_def_11,s),
introduced(definition,[new_symbols(definition,[iPr_def_19])],[]) ).
tcf(c_152,definition,
iPr_def_20 = or(iPr_def_10,iPr_def_19),
introduced(definition,[new_symbols(definition,[iPr_def_20])],[]) ).
tcf(c_153,definition,
iPr_def_21 = or(iPr_def_18,iPr_def_20),
introduced(definition,[new_symbols(definition,[iPr_def_21])],[]) ).
tcf(c_154,definition,
iPr_def_22 = or(iPr_def_14,iPr_def_21),
introduced(definition,[new_symbols(definition,[iPr_def_22])],[]) ).
tcf(c_155,negated_conjecture,
~ theorem(iPr_def_22),
inference(demodulation,[status(thm)],[c_65,c_151,c_152,c_147,c_148,c_149,c_150,c_153,c_143,c_144,c_142,c_145,c_146,c_154]) ).
tcf(c_357,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(X0) ),
inference(superposition,[status(thm)],[c_99,c_64]) ).
tcf(c_358,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_104,c_64]) ).
tcf(c_458,plain,
! [X0: $i] : theorem(or(not(or(iPr_def_18,or(X0,iPr_def_20))),or(X0,iPr_def_21))),
inference(superposition,[status(thm)],[c_153,c_109]) ).
tcf(c_460,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_109,c_64]) ).
tcf(c_1808,plain,
! [X0: $i] :
( theorem(or(X0,iPr_def_21))
| ~ theorem(or(iPr_def_18,or(X0,iPr_def_20))) ),
inference(superposition,[status(thm)],[c_458,c_64]) ).
tcf(c_1954,plain,
! [X0: $i,X1: $i] : theorem(or(X0,or(not(or(X1,X0)),X1))),
inference(superposition,[status(thm)],[c_104,c_460]) ).
tcf(c_2558,plain,
! [X0: $i] :
( theorem(or(X0,iPr_def_21))
| ~ theorem(or(X0,iPr_def_20)) ),
inference(superposition,[status(thm)],[c_357,c_1808]) ).
tcf(c_3097,plain,
! [X0: $i,X1: $i] : theorem(or(or(not(or(X0,X1)),X0),X1)),
inference(superposition,[status(thm)],[c_1954,c_358]) ).
tcf(c_6755,plain,
! [X0: $i] : theorem(or(or(not(or(X0,iPr_def_20)),X0),iPr_def_21)),
inference(superposition,[status(thm)],[c_3097,c_2558]) ).
tcf(c_7994,plain,
! [X0: $i] : theorem(or(iPr_def_21,or(not(or(X0,iPr_def_20)),X0))),
inference(superposition,[status(thm)],[c_6755,c_358]) ).
tcf(c_8285,plain,
! [X0: $i] : theorem(or(not(or(X0,iPr_def_20)),or(iPr_def_21,X0))),
inference(superposition,[status(thm)],[c_7994,c_460]) ).
tcf(c_16151,plain,
! [X0: $i] :
( theorem(or(iPr_def_21,X0))
| ~ theorem(or(X0,iPr_def_20)) ),
inference(superposition,[status(thm)],[c_8285,c_64]) ).
tcf(c_16159,plain,
( theorem(or(iPr_def_21,p))
| ~ theorem(or(p,iPr_def_20)) ),
inference(instantiation,[status(thm)],[c_16151]) ).
tcf(c_143589,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_109,c_64]) ).
tcf(c_143636,plain,
! [X0: $i] : theorem(or(not(or(not(iPr_def_12),X0)),or(not(iPr_def_13),or(iPr_def_10,X0)))),
inference(superposition,[status(thm)],[c_145,c_114]) ).
tcf(c_143650,plain,
! [X0: $i] : theorem(or(not(or(not(X0),iPr_def_21)),or(not(or(iPr_def_14,X0)),iPr_def_22))),
inference(superposition,[status(thm)],[c_154,c_114]) ).
tcf(c_143651,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(or(X2,X0)),or(X2,X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_114,c_64]) ).
tcf(c_143653,plain,
! [X0: $i] : theorem(or(not(or(not(iPr_def_12),X0)),or(iPr_def_14,or(iPr_def_10,X0)))),
inference(light_normalisation,[status(thm)],[c_143636,c_146]) ).
tcf(c_144637,plain,
! [X0: $i,X1: $i,X2: $i] : theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))),
inference(superposition,[status(thm)],[c_114,c_143589]) ).
tcf(c_145449,plain,
! [X0: $i] :
( theorem(or(iPr_def_14,or(iPr_def_10,X0)))
| ~ theorem(or(not(iPr_def_12),X0)) ),
inference(superposition,[status(thm)],[c_143653,c_64]) ).
tcf(c_147615,plain,
! [X0: $i] :
( theorem(or(not(or(iPr_def_14,X0)),iPr_def_22))
| ~ theorem(or(not(X0),iPr_def_21)) ),
inference(superposition,[status(thm)],[c_143650,c_64]) ).
tcf(c_147890,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X2,or(not(or(X2,X0)),X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_143651,c_143589]) ).
tcf(c_153400,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(or(not(X1),X2)),or(X0,X2)))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_144637,c_64]) ).
tcf(c_154360,plain,
! [X0: $i] :
( theorem(iPr_def_22)
| ~ theorem(or(iPr_def_14,X0))
| ~ theorem(or(not(X0),iPr_def_21)) ),
inference(superposition,[status(thm)],[c_147615,c_64]) ).
tcf(c_154364,plain,
! [X0: $i] :
( ~ theorem(or(iPr_def_14,X0))
| ~ theorem(or(not(X0),iPr_def_21)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_154360,c_155]) ).
tcf(c_162442,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(or(iPr_def_10,X1)),or(X0,X1)))
| ~ theorem(or(X0,p)) ),
inference(superposition,[status(thm)],[c_142,c_153400]) ).
tcf(c_235174,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(or(not(X2),X0)),X1))
| ~ theorem(X2)
| ~ theorem(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_147890,c_64]) ).
tcf(c_235636,plain,
! [X0: $i,X1: $i] :
( ~ theorem(X0)
| ~ theorem(or(not(X1),iPr_def_21))
| ~ theorem(or(iPr_def_14,or(not(X0),X1))) ),
inference(superposition,[status(thm)],[c_235174,c_154364]) ).
tcf(c_236775,plain,
! [X0: $i,X1: $i] :
( ~ theorem(or(iPr_def_14,X0))
| ~ theorem(or(not(X1),iPr_def_21))
| ~ theorem(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_147890,c_235636]) ).
tcf(c_238288,plain,
! [X0: $i,X1: $i] :
( ~ theorem(or(X0,p))
| ~ theorem(or(iPr_def_14,or(iPr_def_10,X1)))
| ~ theorem(or(not(or(X0,X1)),iPr_def_21)) ),
inference(superposition,[status(thm)],[c_162442,c_236775]) ).
tcf(c_305101,plain,
( ~ theorem(or(iPr_def_21,p))
| ~ theorem(or(iPr_def_14,or(iPr_def_10,iPr_def_21))) ),
inference(superposition,[status(thm)],[c_94,c_238288]) ).
tcf(c_323812,plain,
( ~ theorem(or(iPr_def_21,p))
| ~ theorem(or(not(iPr_def_12),iPr_def_21)) ),
inference(superposition,[status(thm)],[c_145449,c_305101]) ).
tcf(c_347830,plain,
! [X0: $i] : theorem(or(iPr_def_10,or(X0,p))),
inference(superposition,[status(thm)],[c_142,c_99]) ).
tcf(c_347883,plain,
! [X0: $i] : theorem(or(not(or(iPr_def_10,or(X0,iPr_def_19))),or(X0,iPr_def_20))),
inference(superposition,[status(thm)],[c_152,c_109]) ).
tcf(c_347886,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_109,c_64]) ).
tcf(c_347907,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(iPr_def_15,X0)),or(not(or(X1,r)),or(X1,X0)))),
inference(superposition,[status(thm)],[c_147,c_114]) ).
tcf(c_347923,plain,
! [X0: $i] : theorem(or(not(or(not(X0),iPr_def_19)),or(not(or(iPr_def_10,X0)),iPr_def_20))),
inference(superposition,[status(thm)],[c_152,c_114]) ).
tcf(c_347926,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(or(X2,X0)),or(X2,X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_114,c_64]) ).
tcf(c_348378,plain,
! [X0: $i] :
( theorem(or(X0,iPr_def_20))
| ~ theorem(or(iPr_def_10,or(X0,iPr_def_19))) ),
inference(superposition,[status(thm)],[c_347883,c_64]) ).
tcf(c_348586,plain,
theorem(or(not(or(iPr_def_15,s)),or(not(or(iPr_def_11,r)),iPr_def_19))),
inference(superposition,[status(thm)],[c_151,c_347907]) ).
tcf(c_348593,plain,
theorem(or(not(iPr_def_16),or(not(iPr_def_12),iPr_def_19))),
inference(light_normalisation,[status(thm)],[c_348586,c_144,c_148]) ).
tcf(c_348900,plain,
theorem(or(not(or(not(iPr_def_16),iPr_def_19)),or(not(iPr_def_17),iPr_def_20))),
inference(superposition,[status(thm)],[c_149,c_347923]) ).
tcf(c_348905,plain,
theorem(or(not(or(not(iPr_def_16),iPr_def_19)),iPr_def_21)),
inference(light_normalisation,[status(thm)],[c_348900,c_150,c_153]) ).
tcf(c_348962,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X2,X1))
| ~ theorem(or(X2,X0))
| ~ theorem(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_347926,c_64]) ).
tcf(c_349983,plain,
theorem(or(not(iPr_def_12),or(not(iPr_def_16),iPr_def_19))),
inference(superposition,[status(thm)],[c_348593,c_347886]) ).
tcf(c_350516,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X0,or(X2,X1)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_104,c_348962]) ).
tcf(c_350633,plain,
! [X0: $i] :
( theorem(or(X0,iPr_def_21))
| ~ theorem(or(X0,or(not(iPr_def_16),iPr_def_19))) ),
inference(superposition,[status(thm)],[c_348905,c_348962]) ).
tcf(c_361161,plain,
! [X0: $i] : theorem(or(iPr_def_10,or(p,X0))),
inference(superposition,[status(thm)],[c_347830,c_350516]) ).
tcf(c_362746,plain,
theorem(or(p,iPr_def_20)),
inference(superposition,[status(thm)],[c_361161,c_348378]) ).
tcf(c_402787,plain,
theorem(or(not(iPr_def_12),iPr_def_21)),
inference(superposition,[status(thm)],[c_349983,c_350633]) ).
tcf(c_402823,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_402787,c_362746,c_323812,c_16159]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL229-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.38 % Computer : n005.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Wed Sep 23 22:28:33 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 112.95/30.09 % SZS status Started for theBenchmark.p
% 112.95/30.09 % SZS status Unsatisfiable for theBenchmark.p
% 112.95/30.09
% 112.95/30.09 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 112.95/30.09
% 112.95/30.09 % ------ iProver source info
% 112.95/30.09
% 112.95/30.09 % git: date: 2026-07-19 20:42:38 +0200
% 112.95/30.09 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 112.95/30.09 % git: non_committed_changes: false
% 112.95/30.09
% 112.95/30.09 % ------ Parsing...% successful
% 112.95/30.09
% 112.95/30.09
% 112.95/30.09 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 112.95/30.09
% 112.95/30.09 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 112.95/30.09
% 112.95/30.09 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 112.95/30.09
% 112.95/30.09 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 112.95/30.09 % ------ Proving...
% 112.95/30.09 % ------ Problem Properties
% 112.95/30.09
% 112.95/30.09 %
% 112.95/30.09 % clauses 20
% 112.95/30.09 % conjectures 1
% 112.95/30.09 % EPR 1
% 112.95/30.09 % Horn 20
% 112.95/30.09 % unary 19
% 112.95/30.09 % binary 0
% 112.95/30.09 % lits 22
% 112.95/30.09 % lits eq 13
% 112.95/30.09 % fd_pure 0
% 112.95/30.09 % fd_pseudo 0
% 112.95/30.09 % fd_cond 0
% 112.95/30.09 % fd_pseudo_cond 0
% 112.95/30.09 % AC symbols 0
% 112.95/30.09
% 112.95/30.09 % ------ Schedule dynamic 5 is on
% 112.95/30.09
% 112.95/30.09 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 112.95/30.09
% 112.95/30.09
% 112.95/30.09 % ------
% 112.95/30.09 % Current options:
% 112.95/30.09 % ------
% 112.95/30.09
% 112.95/30.09
% 112.95/30.09 %
% 112.95/30.09
% 112.95/30.09 % ------ Proving...
% 112.95/30.09 % Proof_search_loop: time out after: 7515 full_loop iterations
% 112.95/30.09
% 112.95/30.09 % ------ Input Options"1. --res_lit_sel adaptive --res_lit_sel_side num_symb" Time Limit: 15.
% 112.95/30.09
% 112.95/30.09
% 112.95/30.09 % ------
% 112.95/30.09 % Current options:
% 112.95/30.09 % ------
% 112.95/30.09
% 112.95/30.09
% 112.95/30.09 %
% 112.95/30.09
% 112.95/30.09 % ------ Proving...
% 112.95/30.09 % Proof_search_loop: time out after: 12058 full_loop iterations
% 112.95/30.09
% 112.95/30.09 % ------ Option_1: Negative Selections Time Limit: 35.
% 112.95/30.09
% 112.95/30.09
% 112.95/30.09 % ------
% 112.95/30.09 % Current options:
% 112.95/30.09 % ------
% 112.95/30.09
% 112.95/30.09
% 112.95/30.09 %
% 112.95/30.09
% 112.95/30.09 % ------ Proving...
% 112.95/30.09 %
% 112.95/30.09
% 112.95/30.09 % SZS status Unsatisfiable for theBenchmark.p
% 112.95/30.09
% 112.95/30.09 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 112.95/30.09
% 112.95/30.09
%------------------------------------------------------------------------------