%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL345-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 : n001.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:23 PM UTC 2026
% Result : Unsatisfiable 14.97s 5.04s
% Output : CNFRefutation 14.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 27
% Syntax : Number of formulae : 99 ( 75 unt; 17 def)
% Number of atoms : 276 ( 21 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 69 ( 37 ~; 32 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 21 ( 19 usr; 18 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 87 ( 0 sgn 87 !; 0 ?; 54 :)
% Comments :
%------------------------------------------------------------------------------
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,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-1.ax',and_defn) ).
fof(f10,axiom,
! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
fof(f11,negated_conjecture,
~ theorem(or(equivalent(or(p,q),p),equivalent(or(p,q),q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f12,plain,
! [X0,X1] : equivalent(X0,X1) = not(or(not(or(not(X0),X1)),not(or(not(X1),X0)))),
inference(definition_unfolding,[],[f10,f9,f6,f6]) ).
fof(f14,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f15,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f16,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f17,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(f18,plain,
! [X0,X1] :
( ~ theorem(X1)
| ~ theorem(or(not(X1),X0))
| theorem(X0) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f19,plain,
~ theorem(or(not(or(not(or(not(or(p,q)),p)),not(or(not(p),or(p,q))))),not(or(not(or(not(or(p,q)),q)),not(or(not(q),or(p,q))))))),
inference(definition_unfolding,[],[f11,f12,f12]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] : axiom(or(not(X0),or(X1,X0))),
inference(cnf_transformation,[],[f14]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(cnf_transformation,[],[f15]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(cnf_transformation,[],[f16]) ).
tcf(c_64,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,[],[f17]) ).
tcf(c_65,plain,
! [X0: $i] :
( theorem(X0)
| ~ axiom(X0) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i] :
( theorem(X1)
| ~ theorem(X0)
| ~ theorem(or(not(X0),X1)) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_67,negated_conjecture,
~ theorem(or(not(or(not(or(not(or(p,q)),p)),not(or(not(p),or(p,q))))),not(or(not(or(not(or(p,q)),q)),not(or(not(q),or(p,q))))))),
inference(cnf_transformation,[],[f19]) ).
tcf(c_101,plain,
! [X0: $i,X1: $i] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[status(thm)],[c_65,c_61]) ).
tcf(c_106,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[status(thm)],[c_65,c_62]) ).
tcf(c_111,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_65,c_63]) ).
tcf(c_116,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_65,c_64]) ).
tcf(c_144,definition,
iPr_def_10 = or(p,q),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_145,definition,
iPr_def_11 = not(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_146,definition,
iPr_def_12 = or(iPr_def_11,p),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_147,definition,
iPr_def_13 = not(iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_148,definition,
iPr_def_14 = not(p),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_149,definition,
iPr_def_15 = or(iPr_def_14,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_150,definition,
iPr_def_16 = not(iPr_def_15),
introduced(definition,[new_symbols(definition,[iPr_def_16])],[]) ).
tcf(c_151,definition,
iPr_def_17 = or(iPr_def_13,iPr_def_16),
introduced(definition,[new_symbols(definition,[iPr_def_17])],[]) ).
tcf(c_152,definition,
iPr_def_18 = not(iPr_def_17),
introduced(definition,[new_symbols(definition,[iPr_def_18])],[]) ).
tcf(c_153,definition,
iPr_def_19 = or(iPr_def_11,q),
introduced(definition,[new_symbols(definition,[iPr_def_19])],[]) ).
tcf(c_154,definition,
iPr_def_20 = not(iPr_def_19),
introduced(definition,[new_symbols(definition,[iPr_def_20])],[]) ).
tcf(c_155,definition,
iPr_def_21 = not(q),
introduced(definition,[new_symbols(definition,[iPr_def_21])],[]) ).
tcf(c_156,definition,
iPr_def_22 = or(iPr_def_21,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_22])],[]) ).
tcf(c_157,definition,
iPr_def_23 = not(iPr_def_22),
introduced(definition,[new_symbols(definition,[iPr_def_23])],[]) ).
tcf(c_158,definition,
iPr_def_24 = or(iPr_def_20,iPr_def_23),
introduced(definition,[new_symbols(definition,[iPr_def_24])],[]) ).
tcf(c_159,definition,
iPr_def_25 = not(iPr_def_24),
introduced(definition,[new_symbols(definition,[iPr_def_25])],[]) ).
tcf(c_160,definition,
iPr_def_26 = or(iPr_def_18,iPr_def_25),
introduced(definition,[new_symbols(definition,[iPr_def_26])],[]) ).
tcf(c_161,negated_conjecture,
~ theorem(iPr_def_26),
inference(demodulation,[status(thm)],[c_67,c_155,c_156,c_157,c_153,c_154,c_158,c_159,c_148,c_149,c_150,c_144,c_145,c_146,c_147,c_151,c_152,c_160]) ).
tcf(c_326,plain,
! [X0: $i] : theorem(or(iPr_def_14,or(X0,p))),
inference(superposition,[status(thm)],[c_148,c_101]) ).
tcf(c_328,plain,
! [X0: $i] : theorem(or(iPr_def_11,or(X0,iPr_def_10))),
inference(superposition,[status(thm)],[c_145,c_101]) ).
tcf(c_335,plain,
theorem(or(not(q),iPr_def_10)),
inference(superposition,[status(thm)],[c_144,c_101]) ).
tcf(c_336,plain,
theorem(or(not(p),iPr_def_12)),
inference(superposition,[status(thm)],[c_146,c_101]) ).
tcf(c_346,plain,
theorem(or(iPr_def_14,iPr_def_12)),
inference(light_normalisation,[status(thm)],[c_336,c_148]) ).
tcf(c_347,plain,
theorem(iPr_def_22),
inference(light_normalisation,[status(thm)],[c_335,c_155,c_156]) ).
tcf(c_360,plain,
theorem(or(not(iPr_def_17),or(iPr_def_16,iPr_def_13))),
inference(superposition,[status(thm)],[c_151,c_106]) ).
tcf(c_363,plain,
theorem(or(not(iPr_def_24),or(iPr_def_23,iPr_def_20))),
inference(superposition,[status(thm)],[c_158,c_106]) ).
tcf(c_365,plain,
theorem(or(not(or(q,p)),iPr_def_10)),
inference(superposition,[status(thm)],[c_144,c_106]) ).
tcf(c_373,plain,
theorem(or(iPr_def_25,or(iPr_def_23,iPr_def_20))),
inference(light_normalisation,[status(thm)],[c_363,c_159]) ).
tcf(c_376,plain,
theorem(or(iPr_def_18,or(iPr_def_16,iPr_def_13))),
inference(light_normalisation,[status(thm)],[c_360,c_152]) ).
tcf(c_397,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_106,c_66]) ).
tcf(c_402,plain,
! [X0: $i] :
( theorem(X0)
| ~ theorem(iPr_def_15)
| ~ theorem(or(iPr_def_16,X0)) ),
inference(superposition,[status(thm)],[c_150,c_66]) ).
tcf(c_405,plain,
! [X0: $i] :
( theorem(X0)
| ~ theorem(iPr_def_22)
| ~ theorem(or(iPr_def_23,X0)) ),
inference(superposition,[status(thm)],[c_157,c_66]) ).
tcf(c_416,plain,
! [X0: $i] :
( theorem(X0)
| ~ theorem(or(iPr_def_23,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_405,c_347]) ).
tcf(c_496,plain,
! [X0: $i] : theorem(or(not(or(X0,iPr_def_10)),or(p,or(X0,q)))),
inference(superposition,[status(thm)],[c_144,c_111]) ).
tcf(c_512,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_111,c_66]) ).
tcf(c_583,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(iPr_def_14,X0)),or(not(or(X1,p)),or(X1,X0)))),
inference(superposition,[status(thm)],[c_148,c_116]) ).
tcf(c_586,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(iPr_def_13,X0)),or(not(or(X1,iPr_def_12)),or(X1,X0)))),
inference(superposition,[status(thm)],[c_147,c_116]) ).
tcf(c_589,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(iPr_def_20,X0)),or(not(or(X1,iPr_def_19)),or(X1,X0)))),
inference(superposition,[status(thm)],[c_154,c_116]) ).
tcf(c_602,plain,
! [X0: $i] : theorem(or(not(or(not(X0),iPr_def_10)),or(not(or(iPr_def_14,X0)),iPr_def_15))),
inference(superposition,[status(thm)],[c_149,c_116]) ).
tcf(c_1563,plain,
theorem(or(not(or(iPr_def_11,iPr_def_10)),or(p,iPr_def_19))),
inference(superposition,[status(thm)],[c_153,c_496]) ).
tcf(c_1611,plain,
( theorem(or(p,iPr_def_19))
| ~ theorem(or(iPr_def_11,iPr_def_10)) ),
inference(superposition,[status(thm)],[c_1563,c_66]) ).
tcf(c_2363,plain,
! [X0: $i] : theorem(or(X0,or(iPr_def_11,iPr_def_10))),
inference(superposition,[status(thm)],[c_328,c_512]) ).
tcf(c_2371,plain,
theorem(or(iPr_def_23,or(iPr_def_25,iPr_def_20))),
inference(superposition,[status(thm)],[c_373,c_512]) ).
tcf(c_2374,plain,
theorem(or(iPr_def_16,or(iPr_def_18,iPr_def_13))),
inference(superposition,[status(thm)],[c_376,c_512]) ).
tcf(c_2658,plain,
theorem(or(iPr_def_11,iPr_def_10)),
inference(superposition,[status(thm)],[c_2363,c_416]) ).
tcf(c_2661,plain,
theorem(or(p,iPr_def_19)),
inference(backward_subsumption_resolution,[status(thm)],[c_1611,c_2658]) ).
tcf(c_2665,plain,
theorem(or(iPr_def_19,p)),
inference(superposition,[status(thm)],[c_2661,c_397]) ).
tcf(c_2677,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(or(X1,p)),or(X1,X0)))
| ~ theorem(or(iPr_def_14,X0)) ),
inference(superposition,[status(thm)],[c_583,c_66]) ).
tcf(c_2951,plain,
theorem(or(iPr_def_25,iPr_def_20)),
inference(superposition,[status(thm)],[c_2371,c_416]) ).
tcf(c_2953,plain,
theorem(or(iPr_def_20,iPr_def_25)),
inference(superposition,[status(thm)],[c_2951,c_397]) ).
tcf(c_3018,plain,
( theorem(or(iPr_def_18,iPr_def_13))
| ~ theorem(iPr_def_15) ),
inference(superposition,[status(thm)],[c_2374,c_402]) ).
tcf(c_3099,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(or(X1,iPr_def_12)),or(X1,X0)))
| ~ theorem(or(iPr_def_13,X0)) ),
inference(superposition,[status(thm)],[c_586,c_66]) ).
tcf(c_3550,plain,
( theorem(or(iPr_def_13,iPr_def_18))
| ~ theorem(iPr_def_15) ),
inference(superposition,[status(thm)],[c_3018,c_397]) ).
tcf(c_3629,plain,
theorem(or(not(or(iPr_def_20,iPr_def_25)),or(not(or(iPr_def_18,iPr_def_19)),iPr_def_26))),
inference(superposition,[status(thm)],[c_160,c_589]) ).
tcf(c_4913,plain,
! [X0: $i] :
( theorem(or(not(or(iPr_def_14,X0)),iPr_def_15))
| ~ theorem(or(not(X0),iPr_def_10)) ),
inference(superposition,[status(thm)],[c_602,c_66]) ).
tcf(c_7852,plain,
( theorem(or(not(or(iPr_def_18,iPr_def_19)),iPr_def_26))
| ~ theorem(or(iPr_def_20,iPr_def_25)) ),
inference(superposition,[status(thm)],[c_3629,c_66]) ).
tcf(c_7855,plain,
theorem(or(not(or(iPr_def_18,iPr_def_19)),iPr_def_26)),
inference(forward_subsumption_resolution,[status(thm)],[c_7852,c_2953]) ).
tcf(c_7980,plain,
( theorem(iPr_def_26)
| ~ theorem(or(iPr_def_18,iPr_def_19)) ),
inference(superposition,[status(thm)],[c_7855,c_66]) ).
tcf(c_7982,plain,
~ theorem(or(iPr_def_18,iPr_def_19)),
inference(forward_subsumption_resolution,[status(thm)],[c_7980,c_161]) ).
tcf(c_14143,plain,
! [X0: $i] :
( theorem(iPr_def_15)
| ~ theorem(or(iPr_def_14,X0))
| ~ theorem(or(not(X0),iPr_def_10)) ),
inference(superposition,[status(thm)],[c_4913,c_66]) ).
tcf(c_17119,plain,
! [X0: $i,X1: $i] :
( theorem(or(X0,X1))
| ~ theorem(or(iPr_def_14,X1))
| ~ theorem(or(X0,p)) ),
inference(superposition,[status(thm)],[c_2677,c_66]) ).
tcf(c_17840,plain,
( theorem(iPr_def_15)
| ~ theorem(or(iPr_def_14,or(q,p))) ),
inference(superposition,[status(thm)],[c_365,c_14143]) ).
tcf(c_17883,plain,
theorem(iPr_def_15),
inference(forward_subsumption_resolution,[status(thm)],[c_17840,c_326]) ).
tcf(c_17896,plain,
theorem(or(iPr_def_13,iPr_def_18)),
inference(backward_subsumption_resolution,[status(thm)],[c_3550,c_17883]) ).
tcf(c_18617,plain,
! [X0: $i,X1: $i] :
( theorem(or(X0,X1))
| ~ theorem(or(iPr_def_13,X1))
| ~ theorem(or(X0,iPr_def_12)) ),
inference(superposition,[status(thm)],[c_3099,c_66]) ).
tcf(c_19080,plain,
! [X0: $i] :
( theorem(or(iPr_def_19,X0))
| ~ theorem(or(iPr_def_14,X0)) ),
inference(superposition,[status(thm)],[c_2665,c_17119]) ).
tcf(c_19828,plain,
! [X0: $i] :
( theorem(or(iPr_def_14,X0))
| ~ theorem(or(iPr_def_13,X0)) ),
inference(superposition,[status(thm)],[c_346,c_18617]) ).
tcf(c_34691,plain,
theorem(or(iPr_def_14,iPr_def_18)),
inference(superposition,[status(thm)],[c_17896,c_19828]) ).
tcf(c_34831,plain,
theorem(or(iPr_def_19,iPr_def_18)),
inference(superposition,[status(thm)],[c_34691,c_19080]) ).
tcf(c_34990,plain,
theorem(or(iPr_def_18,iPr_def_19)),
inference(superposition,[status(thm)],[c_34831,c_397]) ).
tcf(c_34991,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_34990,c_7982]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL345-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.18/0.43 % Computer : n001.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Wed Sep 23 23:00:37 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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.21/0.52
% 0.21/0.52 % ======== iProver multi-core TPTP/SMT =========
% 0.21/0.52
% 0.21/0.52 % Detected problem language: tptp
% 0.21/0.54 % Proving...
% 14.97/5.04 % SZS status Started for theBenchmark.p
% 14.97/5.04 % SZS status Unsatisfiable for theBenchmark.p
% 14.97/5.04
% 14.97/5.04 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 14.97/5.04
% 14.97/5.04 % ------ iProver source info
% 14.97/5.04
% 14.97/5.04 % git: date: 2026-07-19 20:42:38 +0200
% 14.97/5.04 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 14.97/5.04 % git: non_committed_changes: false
% 14.97/5.04
% 14.97/5.04 % ------ Parsing...% successful
% 14.97/5.04
% 14.97/5.04
% 14.97/5.04 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 14.97/5.04
% 14.97/5.04 % ------ 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 %
% 14.97/5.04
% 14.97/5.04 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 14.97/5.04
% 14.97/5.04 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 14.97/5.04 % ------ Proving...
% 14.97/5.04 % ------ Problem Properties
% 14.97/5.04
% 14.97/5.04 %
% 14.97/5.04 % clauses 24
% 14.97/5.04 % conjectures 1
% 14.97/5.04 % EPR 1
% 14.97/5.04 % Horn 24
% 14.97/5.04 % unary 23
% 14.97/5.04 % binary 0
% 14.97/5.04 % lits 26
% 14.97/5.04 % lits eq 17
% 14.97/5.04 % fd_pure 0
% 14.97/5.04 % fd_pseudo 0
% 14.97/5.04 % fd_cond 0
% 14.97/5.04 % fd_pseudo_cond 0
% 14.97/5.04 % AC symbols 0
% 14.97/5.04
% 14.97/5.04 % ------ Schedule dynamic 5 is on
% 14.97/5.04
% 14.97/5.04 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 14.97/5.04
% 14.97/5.04
% 14.97/5.04 % ------
% 14.97/5.04 % Current options:
% 14.97/5.04 % ------
% 14.97/5.04
% 14.97/5.04
% 14.97/5.04 %
% 14.97/5.04
% 14.97/5.04 % ------ Proving...
% 14.97/5.04 %
% 14.97/5.04
% 14.97/5.04 % SZS status Unsatisfiable for theBenchmark.p
% 14.97/5.04
% 14.97/5.04 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 14.97/5.04
% 14.97/5.04
%------------------------------------------------------------------------------