%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LCL177-1 : TPTP v9.2.1. Released v1.1.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 : n001.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:35 PM UTC 2026
% Result : Unsatisfiable 0.26s 1.62s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 48 ( 31 unt; 0 nHn; 22 RR)
% Number of literals : 76 ( 0 equ; 31 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 91 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_1_6,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).
cnf(axiom_1_5,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
cnf(axiom_1_4,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).
cnf(rule_3,axiom,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(X1),X3))
| ~ theorem(or(not(X3),X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_3) ).
cnf(axiom_1_2,axiom,
axiom(or(not(or(X1,X1)),X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).
cnf(axiom_1_3,axiom,
axiom(or(not(X1),or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
cnf(rule_2,axiom,
( theorem(X1)
| ~ axiom(or(not(X2),X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_2) ).
cnf(prove_this,negated_conjecture,
~ theorem(or(p,not(p))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_1) ).
cnf(i_0_9,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
axiom_1_6,
[final] ).
cnf(i_0_10,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
axiom_1_5,
[final] ).
cnf(i_0_11,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
axiom_1_4,
[final] ).
cnf(i_0_12,axiom,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(X1),X3))
| ~ theorem(or(not(X3),X2)) ),
rule_3,
[final] ).
cnf(i_0_13,axiom,
axiom(or(not(or(X1,X1)),X1)),
axiom_1_2,
[final] ).
cnf(i_0_14,axiom,
axiom(or(not(X1),or(X2,X1))),
axiom_1_3,
[final] ).
cnf(i_0_15,axiom,
( theorem(X1)
| ~ axiom(or(not(X2),X1))
| ~ theorem(X2) ),
rule_2,
[final] ).
cnf(i_0_16,negated_conjecture,
~ theorem(or(p,not(p))),
prove_this,
[final] ).
cnf(i_0_17,axiom,
( theorem(X1)
| ~ axiom(X1) ),
rule_1,
[final] ).
cnf(i_0_18,plain,
theorem(or(not(or(X1,X2)),or(X2,X1))),
inference(scs_inference,[],[i_0_11,i_0_17]) ).
cnf(i_0_19,plain,
( ~ axiom(X1)
| theorem(X1) ),
inference(rename_variables,[],[i_0_17]) ).
cnf(i_0_20,plain,
~ theorem(or(not(p),p)),
inference(scs_inference,[],[i_0_16,i_0_11,i_0_17,i_0_15]) ).
cnf(i_0_21,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rename_variables,[],[i_0_11]) ).
cnf(i_0_22,plain,
( ~ axiom(or(not(X1),X2))
| ~ theorem(X1)
| theorem(X2) ),
inference(rename_variables,[],[i_0_15]) ).
cnf(i_0_23,plain,
theorem(or(not(or(p,not(p))),or(p,not(p)))),
inference(scs_inference,[],[i_0_16,i_0_11,i_0_21,i_0_17,i_0_15,i_0_12]) ).
cnf(i_0_24,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rename_variables,[],[i_0_11]) ).
cnf(i_0_25,plain,
( ~ theorem(or(not(X1),X2))
| theorem(or(not(X3),X2))
| ~ axiom(or(not(X3),X1)) ),
inference(rename_variables,[],[i_0_12]) ).
cnf(i_0_26,plain,
theorem(or(not(X1),or(X2,X1))),
inference(scs_inference,[],[i_0_14,i_0_17]) ).
cnf(i_0_27,plain,
( ~ axiom(X1)
| theorem(X1) ),
inference(rename_variables,[],[i_0_17]) ).
cnf(i_0_28,plain,
theorem(or(X1,or(not(or(X2,X3)),or(X3,X2)))),
inference(scs_inference,[],[i_0_18,i_0_14,i_0_17,i_0_15]) ).
cnf(i_0_29,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rename_variables,[],[i_0_14]) ).
cnf(i_0_30,plain,
( ~ axiom(or(not(X1),X2))
| ~ theorem(X1)
| theorem(X2) ),
inference(rename_variables,[],[i_0_15]) ).
cnf(i_0_31,plain,
theorem(or(not(X1),or(X1,X2))),
inference(scs_inference,[],[i_0_18,i_0_14,i_0_29,i_0_17,i_0_15,i_0_12]) ).
cnf(i_0_32,plain,
theorem(or(not(or(X1,X2)),or(X2,X1))),
inference(rename_variables,[],[i_0_18]) ).
cnf(i_0_33,plain,
( ~ theorem(or(not(X1),X2))
| theorem(or(not(X3),X2))
| ~ axiom(or(not(X3),X1)) ),
inference(rename_variables,[],[i_0_12]) ).
cnf(i_0_34,plain,
theorem(or(not(or(X1,X1)),X1)),
inference(scs_inference,[],[i_0_13,i_0_17]) ).
cnf(i_0_35,plain,
( ~ axiom(X1)
| theorem(X1) ),
inference(rename_variables,[],[i_0_17]) ).
cnf(i_0_36,plain,
theorem(or(not(or(X1,X2)),or(X3,or(X2,X1)))),
inference(scs_inference,[],[i_0_28,i_0_13,i_0_10,i_0_17,i_0_15]) ).
cnf(i_0_37,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rename_variables,[],[i_0_10]) ).
cnf(i_0_38,plain,
( ~ axiom(or(not(X1),X2))
| ~ theorem(X1)
| theorem(X2) ),
inference(rename_variables,[],[i_0_15]) ).
cnf(i_0_39,plain,
theorem(or(not(or(X1,X1)),or(X2,X1))),
inference(scs_inference,[],[i_0_28,i_0_26,i_0_13,i_0_10,i_0_17,i_0_15,i_0_12]) ).
cnf(i_0_40,plain,
theorem(or(not(X1),or(X2,X1))),
inference(rename_variables,[],[i_0_26]) ).
cnf(i_0_41,plain,
( ~ theorem(or(not(X1),X2))
| theorem(or(not(X3),X2))
| ~ axiom(or(not(X3),X1)) ),
inference(rename_variables,[],[i_0_12]) ).
cnf(i_0_42,plain,
theorem(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
inference(scs_inference,[],[i_0_9,i_0_17]) ).
cnf(i_0_43,plain,
( ~ axiom(X1)
| theorem(X1) ),
inference(rename_variables,[],[i_0_17]) ).
cnf(i_0_44,plain,
theorem(or(or(X1,or(X2,X3)),not(or(X3,X2)))),
inference(scs_inference,[],[i_0_36,i_0_9,i_0_11,i_0_17,i_0_15]) ).
cnf(i_0_45,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rename_variables,[],[i_0_11]) ).
cnf(i_0_46,plain,
( ~ axiom(or(not(X1),X2))
| ~ theorem(X1)
| theorem(X2) ),
inference(rename_variables,[],[i_0_15]) ).
cnf(i_0_47,plain,
$false,
inference(scs_inference,[],[i_0_36,i_0_20,i_0_34,i_0_9,i_0_11,i_0_14,i_0_17,i_0_15,i_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL177-1 : TPTP v9.2.1. Released v1.1.0.
% 0.00/0.12 % 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.15/0.33 % Computer : n001.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Mon May 4 22:06:33 EDT 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.35 % start to proof: theBenchmark
% 0.26/1.62 % Version : CSE_E---1.7
% 0.26/1.62 % Problem : theBenchmark.p
% 0.26/1.62 % SZS status Unsatisfiable for theBenchmark.p
% 0.26/1.62 % SZS output start CNFRefutation
% See solution above
% 0.26/1.68 % Total time : 1.271s
%------------------------------------------------------------------------------