%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LCL170-3 : TPTP v9.2.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n031.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:34 PM UTC 2026
% Result : Unsatisfiable 0.27s 1.62s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_10)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(prove_this,negated_conjecture,
~ theorem(implies(q,implies(p,q))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(i_0_9,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(i_0_10,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(i_0_11,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(i_0_12,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(i_0_13,negated_conjecture,
~ theorem(implies(q,implies(p,q))),
prove_this ).
cnf(i_0_14,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(i_0_15,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(i_0_16,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
rule_2 ).
cnf(i_0_17,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)],[i_0_9,c_0_10]),c_0_10]),c_0_10]),
[final] ).
cnf(i_0_18,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[i_0_11,c_0_10]),
[final] ).
cnf(i_0_19,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[i_0_12,c_0_10]),
[final] ).
cnf(i_0_20,negated_conjecture,
~ theorem(or(not(q),or(not(p),q))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[i_0_13,c_0_10]),c_0_10]),
[final] ).
cnf(i_0_21,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[i_0_14,c_0_10]),
[final] ).
cnf(i_0_22,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[i_0_15,c_0_10]),
[final] ).
cnf(i_0_23,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ theorem(or(not(X2),X1)) ),
inference(rw,[status(thm)],[i_0_16,c_0_10]),
[final] ).
cnf(i_0_24,axiom,
( theorem(X1)
| ~ axiom(X1) ),
rule_1,
[final] ).
cnf(i_0_25,plain,
$false,
inference(scs_inference,[],[i_0_20,i_0_22,i_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL170-3 : TPTP v9.2.1. Released v2.3.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n031.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 22:07:23 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 0.27/1.62 % Version : CSE_E---1.7
% 0.27/1.62 % Problem : theBenchmark.p
% 0.27/1.62 % SZS status Unsatisfiable for theBenchmark.p
% 0.27/1.62 % SZS output start CNFRefutation
% See solution above
% 0.27/1.63 % Total time : 1.272s
%------------------------------------------------------------------------------