%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LCL229-3 : TPTP v9.2.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n024.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 : Tue May 5 04:39:49 PM UTC 2026
% Result : Unsatisfiable 160.52s 56.51s
% Output : CNFRefutation 160.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of clauses : 57 ( 35 unt; 0 nHn; 21 RR)
% Number of literals : 85 ( 2 equ; 33 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 116 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(prove_this,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) ).
cnf(c_0_9,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_10,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_11,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_12,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_13,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
rule_2 ).
cnf(c_0_14,axiom,
( theorem(X1)
| ~ axiom(X1) ),
rule_1 ).
cnf(c_0_15,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_17,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_18,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ theorem(or(not(X2),X1)) ),
inference(rw,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_19,plain,
theorem(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_21,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_22,plain,
theorem(or(not(or(X1,X1)),X1)),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_23,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( theorem(or(X1,X2))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_25,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_21,c_0_10]) ).
cnf(c_0_26,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_27,plain,
theorem(or(X1,or(not(X2),X2))),
inference(spm,[status(thm)],[c_0_23,c_0_20]) ).
cnf(c_0_28,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_29,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
theorem(or(not(or(X1,X2)),or(X2,X1))),
inference(spm,[status(thm)],[c_0_14,c_0_25]) ).
cnf(c_0_31,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_10]),c_0_10]),c_0_10]) ).
cnf(c_0_33,plain,
( theorem(or(X1,X2))
| ~ theorem(or(or(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_29]) ).
cnf(c_0_34,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_30]) ).
cnf(c_0_35,plain,
theorem(or(X1,or(not(or(X1,X2)),X2))),
inference(spm,[status(thm)],[c_0_23,c_0_31]) ).
cnf(c_0_36,plain,
theorem(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
inference(spm,[status(thm)],[c_0_14,c_0_32]) ).
cnf(c_0_37,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(or(X1,or(X2,X3)),X3)) ),
inference(spm,[status(thm)],[c_0_33,c_0_29]) ).
cnf(c_0_38,plain,
theorem(or(or(not(or(X1,X2)),X2),X1)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_36]) ).
cnf(c_0_40,plain,
theorem(or(not(or(X1,or(X2,X1))),or(X2,X1))),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(X3),X2))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_39]) ).
cnf(c_0_42,plain,
( theorem(or(X1,or(not(or(X1,X2)),X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_23,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
~ theorem(implies(implies(p,implies(q,r)),implies(implies(p,implies(r,s)),implies(p,implies(q,s))))),
prove_this ).
cnf(c_0_44,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,or(X1,X2))) ),
inference(spm,[status(thm)],[c_0_18,c_0_40]) ).
cnf(c_0_45,plain,
( theorem(or(X1,or(not(or(not(X2),X3)),X4)))
| ~ theorem(or(not(X3),X4))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]) ).
cnf(c_0_47,plain,
( theorem(or(not(or(not(X1),X2)),X3))
| ~ theorem(or(not(X2),X3))
| ~ theorem(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_41,c_0_30]) ).
cnf(c_0_49,negated_conjecture,
( ~ theorem(or(not(or(not(q),r)),or(not(or(not(p),or(not(r),s))),or(not(p),or(not(q),s)))))
| ~ theorem(or(or(not(or(not(p),or(not(r),s))),or(not(p),or(not(q),s))),p)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,plain,
( theorem(or(X1,or(not(or(X2,X3)),or(X2,X4))))
| ~ theorem(or(X1,or(not(X3),X4))) ),
inference(spm,[status(thm)],[c_0_41,c_0_36]) ).
cnf(c_0_51,plain,
theorem(or(not(or(X1,X2)),or(not(or(not(X2),X3)),or(X1,X3)))),
inference(spm,[status(thm)],[c_0_23,c_0_36]) ).
cnf(c_0_52,plain,
theorem(or(not(X1),or(X1,X2))),
inference(spm,[status(thm)],[c_0_48,c_0_20]) ).
cnf(c_0_53,negated_conjecture,
~ theorem(or(or(not(or(not(p),or(not(r),s))),or(not(p),or(not(q),s))),p)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]) ).
cnf(c_0_54,plain,
( theorem(or(or(X1,X2),X3))
| ~ theorem(or(X3,X2)) ),
inference(spm,[status(thm)],[c_0_34,c_0_29]) ).
cnf(c_0_55,plain,
theorem(or(X1,or(not(X1),X2))),
inference(spm,[status(thm)],[c_0_23,c_0_52]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : LCL229-3 : TPTP v9.2.1. Released v2.3.0.
% 0.00/0.06 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.06/0.24 % Computer : n024.cluster.edu
% 0.06/0.24 % Model : x86_64 x86_64
% 0.06/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.24 % Memory : 8042.1875MB
% 0.06/0.24 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.24 % CPULimit : 300
% 0.06/0.24 % WCLimit : 300
% 0.06/0.24 % DateTime : Mon May 4 17:13:26 EDT 2026
% 0.06/0.25 % CPUTime :
% 0.06/0.25 % start to proof: theBenchmark
% 160.52/56.51 % Version : CSE_E---1.7
% 160.52/56.51 % Problem : theBenchmark.p
% 160.52/56.51 % SZS status Unsatisfiable for theBenchmark.p
% 160.52/56.51 % SZS output start CNFRefutation
% See solution above
% 160.82/56.84 % Total time : 45.058s
%------------------------------------------------------------------------------