%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LCL154-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 : n013.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:32 PM UTC 2026
% Result : Unsatisfiable 1.31s 1.73s
% Output : CNFRefutation 1.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of clauses : 63 ( 63 unt; 0 nHn; 7 RR)
% Number of literals : 63 ( 62 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 91 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wajsberg_4,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_4) ).
cnf(or_definition,axiom,
or(X1,X2) = implies(not(X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',or_definition) ).
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(false_definition,axiom,
not(truth) = falsehood,
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-1.ax',false_definition) ).
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(and_star_definition,axiom,
and_star(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-1.ax',and_star_definition) ).
cnf(and_definition,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',and_definition) ).
cnf(or_commutativity,axiom,
or(X1,X2) = or(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',or_commutativity) ).
cnf(or_associativity,axiom,
or(or(X1,X2),X3) = or(X1,or(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',or_associativity) ).
cnf(and_star_commutativity,axiom,
and_star(X1,X2) = and_star(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-1.ax',and_star_commutativity) ).
cnf(xor_definition,axiom,
xor(X1,X2) = or(and(X1,not(X2)),and(not(X1),X2)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-1.ax',xor_definition) ).
cnf(prove_alternative_wajsberg_axiom,negated_conjecture,
xor(x,falsehood) != x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_alternative_wajsberg_axiom) ).
cnf(xor_commutativity,axiom,
xor(X1,X2) = xor(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-1.ax',xor_commutativity) ).
cnf(c_0_14,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
wajsberg_4 ).
cnf(c_0_15,axiom,
or(X1,X2) = implies(not(X1),X2),
or_definition ).
cnf(c_0_16,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
wajsberg_2 ).
cnf(c_0_17,axiom,
implies(truth,X1) = X1,
wajsberg_1 ).
cnf(c_0_18,plain,
implies(or(X1,not(X2)),implies(X2,X1)) = truth,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
not(truth) = falsehood,
false_definition ).
cnf(c_0_20,plain,
implies(X1,implies(implies(X1,X2),X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).
cnf(c_0_21,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
wajsberg_3 ).
cnf(c_0_22,axiom,
and_star(X1,X2) = not(or(not(X1),not(X2))),
and_star_definition ).
cnf(c_0_23,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_definition ).
cnf(c_0_24,plain,
implies(or(X1,falsehood),X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_17]),c_0_19]) ).
cnf(c_0_25,axiom,
or(X1,X2) = or(X2,X1),
or_commutativity ).
cnf(c_0_26,plain,
implies(X1,X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_20]),c_0_17]) ).
cnf(c_0_27,plain,
implies(implies(X1,truth),truth) = implies(X1,X1),
inference(spm,[status(thm)],[c_0_21,c_0_17]) ).
cnf(c_0_28,plain,
and(X1,X2) = and_star(X1,X2),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
implies(or(falsehood,X1),X1) = truth,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
or(X1,not(X1)) = truth,
inference(spm,[status(thm)],[c_0_15,c_0_26]) ).
cnf(c_0_31,plain,
implies(implies(X1,truth),truth) = truth,
inference(rw,[status(thm)],[c_0_27,c_0_26]) ).
cnf(c_0_32,plain,
not(or(not(X1),not(X2))) = and_star(X1,X2),
inference(rw,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_33,plain,
not(falsehood) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_17]) ).
cnf(c_0_34,plain,
implies(X1,truth) = truth,
inference(spm,[status(thm)],[c_0_20,c_0_31]) ).
cnf(c_0_35,plain,
not(or(falsehood,not(X1))) = and_star(X1,truth),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_19]),c_0_25]) ).
cnf(c_0_36,plain,
or(falsehood,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_33]),c_0_17]) ).
cnf(c_0_37,plain,
or(X1,truth) = truth,
inference(spm,[status(thm)],[c_0_15,c_0_34]) ).
cnf(c_0_38,plain,
implies(or(not(X1),X2),implies(X1,X2)) = truth,
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_39,plain,
not(not(X1)) = and_star(X1,truth),
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,axiom,
or(or(X1,X2),X3) = or(X1,or(X2,X3)),
or_associativity ).
cnf(c_0_41,plain,
or(X1,falsehood) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_36]) ).
cnf(c_0_42,plain,
implies(falsehood,X1) = or(truth,X1),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_43,plain,
or(truth,X1) = truth,
inference(spm,[status(thm)],[c_0_25,c_0_37]) ).
cnf(c_0_44,plain,
implies(X1,and_star(X1,truth)) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_30]),c_0_17]),c_0_39]) ).
cnf(c_0_45,axiom,
and_star(X1,X2) = and_star(X2,X1),
and_star_commutativity ).
cnf(c_0_46,plain,
or(not(X1),or(not(X2),X3)) = implies(and_star(X1,X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_32]),c_0_40]) ).
cnf(c_0_47,plain,
or(X1,implies(X1,falsehood)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_41]),c_0_15]) ).
cnf(c_0_48,plain,
implies(falsehood,X1) = truth,
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,plain,
implies(X1,and_star(truth,X1)) = truth,
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,plain,
implies(and_star(X1,X2),X2) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_37]),c_0_15]),c_0_41]) ).
cnf(c_0_51,axiom,
xor(X1,X2) = or(and(X1,not(X2)),and(not(X1),X2)),
xor_definition ).
cnf(c_0_52,plain,
implies(implies(X1,falsehood),falsehood) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_48]),c_0_17]) ).
cnf(c_0_53,plain,
and_star(truth,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_49]),c_0_17]),c_0_50]),c_0_17]) ).
cnf(c_0_54,plain,
or(and_star(X1,not(X2)),and_star(not(X1),X2)) = xor(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_28]),c_0_28]) ).
cnf(c_0_55,plain,
and_star(X1,falsehood) = falsehood,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_50]),c_0_17]) ).
cnf(c_0_56,plain,
and_star(X1,truth) = X1,
inference(spm,[status(thm)],[c_0_45,c_0_53]) ).
cnf(c_0_57,negated_conjecture,
xor(x,falsehood) != x,
prove_alternative_wajsberg_axiom ).
cnf(c_0_58,axiom,
xor(X1,X2) = xor(X2,X1),
xor_commutativity ).
cnf(c_0_59,plain,
xor(X1,falsehood) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_33]),c_0_56]),c_0_41]) ).
cnf(c_0_60,negated_conjecture,
xor(falsehood,x) != x,
inference(rw,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_61,plain,
xor(falsehood,X1) = X1,
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL154-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.16/0.33 % Computer : n013.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:05:11 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.31/1.73 % Version : CSE_E---1.7
% 1.31/1.73 % Problem : theBenchmark.p
% 1.31/1.73 % SZS status Unsatisfiable for theBenchmark.p
% 1.31/1.73 % SZS output start CNFRefutation
% See solution above
% 1.31/1.74 % Total time : 1.370s
%------------------------------------------------------------------------------