%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LCL161-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 : n022.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:33 PM UTC 2026
% Result : Unsatisfiable 1.27s 1.71s
% Output : CNFRefutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 27 ( 27 unt; 0 nHn; 5 RR)
% Number of literals : 27 ( 26 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_7,axiom,
xor(X1,xor(truth,X2)) = xor(xor(X1,truth),X2),
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-0.ax',axiom_7) ).
cnf(axiom_1,axiom,
not(X1) = xor(X1,truth),
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-0.ax',axiom_1) ).
cnf(implies_definition,axiom,
implies(X1,X2) = xor(truth,and_star(X1,xor(truth,X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).
cnf(axiom_2,axiom,
xor(X1,falsehood) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-0.ax',axiom_2) ).
cnf(axiom_4,axiom,
and_star(X1,truth) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-0.ax',axiom_4) ).
cnf(false_definition,axiom,
not(truth) = falsehood,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',false_definition) ).
cnf(xor_commutativity,axiom,
xor(X1,X2) = xor(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xor_commutativity) ).
cnf(and_star_commutativity,axiom,
and_star(X1,X2) = and_star(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_star_commutativity) ).
cnf(prove_wajsberg_axiom,negated_conjecture,
implies(truth,x) != x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_wajsberg_axiom) ).
cnf(c_0_9,axiom,
xor(X1,xor(truth,X2)) = xor(xor(X1,truth),X2),
axiom_7 ).
cnf(c_0_10,axiom,
not(X1) = xor(X1,truth),
axiom_1 ).
cnf(c_0_11,axiom,
implies(X1,X2) = xor(truth,and_star(X1,xor(truth,X2))),
implies_definition ).
cnf(c_0_12,axiom,
xor(X1,falsehood) = X1,
axiom_2 ).
cnf(c_0_13,axiom,
and_star(X1,truth) = X1,
axiom_4 ).
cnf(c_0_14,plain,
xor(X1,xor(truth,X2)) = xor(not(X1),X2),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,axiom,
not(truth) = falsehood,
false_definition ).
cnf(c_0_16,plain,
xor(truth,X1) = implies(X1,falsehood),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_17,axiom,
xor(X1,X2) = xor(X2,X1),
xor_commutativity ).
cnf(c_0_18,axiom,
and_star(X1,X2) = and_star(X2,X1),
and_star_commutativity ).
cnf(c_0_19,plain,
not(not(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_10]),c_0_15]),c_0_12]),c_0_10]) ).
cnf(c_0_20,plain,
not(X1) = implies(X1,falsehood),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_10]) ).
cnf(c_0_21,plain,
implies(and_star(X1,implies(X2,falsehood)),falsehood) = implies(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_16]),c_0_16]) ).
cnf(c_0_22,plain,
and_star(truth,X1) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_23,plain,
implies(implies(X1,falsehood),falsehood) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_20]) ).
cnf(c_0_24,negated_conjecture,
implies(truth,x) != x,
prove_wajsberg_axiom ).
cnf(c_0_25,plain,
implies(truth,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL161-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.11 % 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.15/0.32 % Computer : n022.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Mon May 4 22:04:51 EDT 2026
% 0.15/0.32 % CPUTime :
% 0.15/0.33 % start to proof: theBenchmark
% 1.27/1.71 % Version : CSE_E---1.7
% 1.27/1.71 % Problem : theBenchmark.p
% 1.27/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 1.27/1.71 % SZS output start CNFRefutation
% See solution above
% 1.27/1.71 % Total time : 1.371s
%------------------------------------------------------------------------------