%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LCL144-1 : TPTP v9.2.1. Released v1.0.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 : n019.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:31 PM UTC 2026
% Result : Unsatisfiable 1.45s 1.79s
% Output : CNFRefutation 1.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 26 ( 13 unt; 5 nHn; 16 RR)
% Number of literals : 39 ( 24 equ; 13 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(partial_order_definition1,axiom,
( implies(X1,X2) = truth
| ~ ordered(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-1.ax',partial_order_definition1) ).
cnf(antecedent,negated_conjecture,
( ordered(x,implies(y,z))
| ordered(y,implies(x,z)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antecedent) ).
cnf(wajsberg_2,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_2) ).
cnf(wajsberg_1,axiom,
implies(truth,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_1) ).
cnf(prove_wajsberg_theorem,negated_conjecture,
( ~ ordered(x,implies(y,z))
| ~ ordered(y,implies(x,z)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_wajsberg_theorem) ).
cnf(partial_order_definition2,axiom,
( ordered(X1,X2)
| implies(X1,X2) != truth ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-1.ax',partial_order_definition2) ).
cnf(wajsberg_3,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_3) ).
cnf(c_0_7,axiom,
( implies(X1,X2) = truth
| ~ ordered(X1,X2) ),
partial_order_definition1 ).
cnf(c_0_8,negated_conjecture,
( ordered(x,implies(y,z))
| ordered(y,implies(x,z)) ),
antecedent ).
cnf(c_0_9,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
wajsberg_2 ).
cnf(c_0_10,axiom,
implies(truth,X1) = X1,
wajsberg_1 ).
cnf(c_0_11,negated_conjecture,
( implies(y,implies(x,z)) = truth
| ordered(x,implies(y,z)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
implies(X1,implies(implies(X1,X2),X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( implies(y,implies(x,z)) = truth
| implies(x,implies(y,z)) = truth ),
inference(spm,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
( ~ ordered(x,implies(y,z))
| ~ ordered(y,implies(x,z)) ),
prove_wajsberg_theorem ).
cnf(c_0_15,axiom,
( ordered(X1,X2)
| implies(X1,X2) != truth ),
partial_order_definition2 ).
cnf(c_0_16,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
wajsberg_3 ).
cnf(c_0_17,plain,
implies(implies(implies(implies(X1,X2),X2),X3),implies(X1,X3)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_12]),c_0_10]) ).
cnf(c_0_18,negated_conjecture,
( implies(implies(implies(x,z),X1),implies(y,X1)) = truth
| implies(x,implies(y,z)) = truth ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_13]),c_0_10]) ).
cnf(c_0_19,negated_conjecture,
( implies(y,implies(x,z)) != truth
| ~ ordered(x,implies(y,z)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
implies(implies(X1,implies(X2,X3)),implies(implies(implies(X3,X2),X2),implies(X1,X3))) = truth,
inference(spm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
implies(x,implies(y,z)) = truth,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_10])]) ).
cnf(c_0_22,negated_conjecture,
( implies(y,implies(x,z)) != truth
| implies(x,implies(y,z)) != truth ),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_23,negated_conjecture,
implies(implies(implies(y,z),z),implies(x,z)) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_10]),c_0_16]) ).
cnf(c_0_24,negated_conjecture,
implies(y,implies(x,z)) != truth,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_21])]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_23]),c_0_10]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL144-1 : TPTP v9.2.1. Released v1.0.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.14/0.32 % Computer : n019.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Mon May 4 22:03:59 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.33 % start to proof: theBenchmark
% 1.45/1.79 % Version : CSE_E---1.7
% 1.45/1.79 % Problem : theBenchmark.p
% 1.45/1.79 % SZS status Unsatisfiable for theBenchmark.p
% 1.45/1.79 % SZS output start CNFRefutation
% See solution above
% 1.45/1.79 % Total time : 1.371s
%------------------------------------------------------------------------------