%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL154-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:11:54 PM UTC 2026
% Result : Unsatisfiable 0.13s 10.43s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of clauses : 45 ( 45 unt; 0 nHn; 11 RR)
% Number of literals : 45 ( 44 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 58 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wajsberg_4,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_4) ).
cnf(wajsberg_1,axiom,
implies(truth,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_1) ).
cnf(false_definition,axiom,
not(truth) = falsehood,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-1.ax',false_definition) ).
cnf(or_commutativity,axiom,
or(X1,X2) = or(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-2.ax',or_commutativity) ).
cnf(or_definition,axiom,
or(X1,X2) = implies(not(X1),X2),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_2) ).
cnf(wajsberg_3,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_3) ).
cnf(and_definition,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-2.ax',and_definition) ).
cnf(xor_definition,axiom,
xor(X1,X2) = or(and(X1,not(X2)),and(not(X1),X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-1.ax',xor_definition) ).
cnf(prove_alternative_wajsberg_axiom,negated_conjecture,
xor(x,falsehood) != x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_alternative_wajsberg_axiom) ).
cnf(xor_commutativity,axiom,
xor(X1,X2) = xor(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-1.ax',xor_commutativity) ).
cnf(c_0_11,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
wajsberg_4 ).
cnf(c_0_12,axiom,
implies(truth,X1) = X1,
wajsberg_1 ).
cnf(c_0_13,axiom,
not(truth) = falsehood,
false_definition ).
cnf(c_0_14,axiom,
or(X1,X2) = or(X2,X1),
or_commutativity ).
cnf(c_0_15,axiom,
or(X1,X2) = implies(not(X1),X2),
or_definition ).
cnf(c_0_16,plain,
implies(implies(not(X1),falsehood),X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_17,plain,
implies(not(X1),X2) = implies(not(X2),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]) ).
cnf(c_0_18,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
wajsberg_2 ).
cnf(c_0_19,plain,
implies(implies(falsehood,falsehood),truth) = truth,
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_20,plain,
implies(implies(not(falsehood),X1),X1) = truth,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
implies(X1,implies(implies(falsehood,falsehood),X1)) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_12]),c_0_12]) ).
cnf(c_0_22,plain,
implies(implies(falsehood,falsehood),not(falsehood)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_12]) ).
cnf(c_0_23,plain,
implies(not(X1),truth) = implies(falsehood,X1),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_24,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
wajsberg_3 ).
cnf(c_0_25,plain,
implies(falsehood,falsehood) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_26,plain,
implies(implies(X1,not(X2)),not(X2)) = implies(implies(not(X1),X2),X1),
inference(spm,[status(thm)],[c_0_24,c_0_17]) ).
cnf(c_0_27,plain,
not(falsehood) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_25]),c_0_12]) ).
cnf(c_0_28,plain,
implies(X1,implies(implies(X1,X2),X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_12]),c_0_12]) ).
cnf(c_0_29,plain,
implies(implies(falsehood,X1),truth) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_26]),c_0_27]),c_0_13]),c_0_27]) ).
cnf(c_0_30,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_definition ).
cnf(c_0_31,plain,
implies(falsehood,X1) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_23]),c_0_29]),c_0_23]) ).
cnf(c_0_32,axiom,
xor(X1,X2) = or(and(X1,not(X2)),and(not(X1),X2)),
xor_definition ).
cnf(c_0_33,plain,
and(X1,X2) = not(implies(not(not(X1)),not(X2))),
inference(rw,[status(thm)],[c_0_30,c_0_15]) ).
cnf(c_0_34,plain,
implies(not(X1),falsehood) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_27]),c_0_12]) ).
cnf(c_0_35,plain,
implies(X1,falsehood) = not(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_31]),c_0_12]),c_0_27]),c_0_12]) ).
cnf(c_0_36,negated_conjecture,
xor(x,falsehood) != x,
inference(fof_simplification,[status(thm)],[prove_alternative_wajsberg_axiom]) ).
cnf(c_0_37,plain,
xor(X1,X2) = implies(not(not(implies(not(not(X1)),not(not(X2))))),not(implies(not(not(not(X1))),not(X2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_15]),c_0_33]),c_0_33]) ).
cnf(c_0_38,plain,
not(not(X1)) = X1,
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
xor(x,falsehood) != x,
c_0_36 ).
cnf(c_0_40,axiom,
xor(X1,X2) = xor(X2,X1),
xor_commutativity ).
cnf(c_0_41,plain,
implies(implies(X1,X2),not(implies(not(X1),not(X2)))) = xor(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_38]),c_0_38]),c_0_38]) ).
cnf(c_0_42,negated_conjecture,
xor(falsehood,x) != x,
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
xor(falsehood,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_27]),c_0_31]),c_0_12]),c_0_38]),c_0_12]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL154-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/10.37 % Computer : n013.cluster.edu
% 0.09/10.37 % Model : x86_64 x86_64
% 0.09/10.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.37 % Memory : 8046.5625MB
% 0.09/10.37 % OS : Linux 6.8.0-71-generic
% 0.09/10.37 % CPULimit : 300
% 0.09/10.37 % WCLimit : 300
% 0.09/10.37 % DateTime : Mon Sep 21 00:07:16 UTC 2026
% 0.09/10.37 % CPUTime :
% 0.09/10.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/10.41 Running first-order theorem proving
% 0.13/10.41 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/10.43 % Version: 3.5.1
% 0.13/10.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/10.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/10.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/10.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/10.43 % Starting new_bool_1 with 300s (1) cores
% 0.13/10.43 % Starting sh5l with 300s (1) cores
% 0.13/10.43 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3743984 completed with status 0
% 0.13/10.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/10.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/10.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/10.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/10.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/10.43 % No SInE strategy applied
% 0.13/10.43 % Search class: FUUPM-FFSF21-DFFFFFNN
% 0.13/10.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/10.43 % Starting SubtermCWHack with 136s (1) cores
% 0.13/10.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/10.43 % Starting G-E--_201_C45_F1_AE_CS_SP_PI_S0Y with 136s (1) cores
% 0.13/10.43 % Starting new_bool_3 with 136s (1) cores
% 0.13/10.43 % Starting new_bool_1 with 136s (1) cores
% 0.13/10.43 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3743991 completed with status 0
% 0.13/10.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/10.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/10.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/10.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/10.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/10.43 % No SInE strategy applied
% 0.13/10.43 % Search class: FUUPM-FFSF21-DFFFFFNN
% 0.13/10.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/10.43 % Starting SubtermCWHack with 136s (1) cores
% 0.13/10.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/10.43 % Preprocessing time : 0.001 s
% 0.13/10.43 % Presaturation interreduction done
% 0.13/10.43
% 0.13/10.43 % Proof found!
% 0.13/10.43 % SZS status Unsatisfiable
% 0.13/10.43 % SZS output start CNFRefutation
% See solution above
% 0.13/10.44 % Parsed axioms : 17
% 0.13/10.44 % Removed by relevancy pruning/SinE : 0
% 0.13/10.44 % Initial clauses : 17
% 0.13/10.44 % Removed in clause preprocessing : 3
% 0.13/10.44 % Initial clauses in saturation : 14
% 0.13/10.44 % Processed clauses : 77
% 0.13/10.44 % ...of these trivial : 26
% 0.13/10.44 % ...subsumed : 3
% 0.13/10.44 % ...remaining for further processing : 48
% 0.13/10.44 % Other redundant clauses eliminated : 0
% 0.13/10.44 % Clauses deleted for lack of memory : 0
% 0.13/10.44 % Backward-subsumed : 0
% 0.13/10.44 % Backward-rewritten : 13
% 0.13/10.44 % Generated clauses : 466
% 0.13/10.44 % ...of the previous two non-redundant : 321
% 0.13/10.44 % ...aggressively subsumed : 0
% 0.13/10.44 % Contextual simplify-reflections : 0
% 0.13/10.44 % Paramodulations : 466
% 0.13/10.44 % Factorizations : 0
% 0.13/10.44 % NegExts : 0
% 0.13/10.44 % Equation resolutions : 0
% 0.13/10.44 % Disequality decompositions : 0
% 0.13/10.44 % Total rewrite steps : 665
% 0.13/10.44 % ...of those cached : 517
% 0.13/10.44 % Propositional unsat checks : 0
% 0.13/10.44 % Propositional check models : 0
% 0.13/10.44 % Propositional check unsatisfiable : 0
% 0.13/10.44 % Propositional clauses : 0
% 0.13/10.44 % Propositional clauses after purity: 0
% 0.13/10.44 % Propositional unsat core size : 0
% 0.13/10.44 % Propositional preprocessing time : 0.000
% 0.13/10.44 % Propositional encoding time : 0.000
% 0.13/10.44 % Propositional solver time : 0.000
% 0.13/10.44 % Success case prop preproc time : 0.000
% 0.13/10.44 % Success case prop encoding time : 0.000
% 0.13/10.44 % Success case prop solver time : 0.000
% 0.13/10.44 % Current number of processed clauses : 24
% 0.13/10.44 % Positive orientable unit clauses : 20
% 0.13/10.44 % Positive unorientable unit clauses: 4
% 0.13/10.44 % Negative unit clauses : 0
% 0.13/10.44 % Non-unit-clauses : 0
% 0.13/10.44 % Current number of unprocessed clauses: 267
% 0.13/10.44 % ...number of literals in the above : 267
% 0.13/10.44 % Current number of archived formulas : 0
% 0.13/10.44 % Current number of archived clauses : 27
% 0.13/10.44 % Clause-clause subsumption calls (NU) : 0
% 0.13/10.44 % Rec. Clause-clause subsumption calls : 0
% 0.13/10.44 % Non-unit clause-clause subsumptions : 0
% 0.13/10.44 % Unit Clause-clause subsumption calls : 2
% 0.13/10.44 % Rewrite failures with RHS unbound : 0
% 0.13/10.44 % BW rewrite match attempts : 61
% 0.13/10.44 % BW rewrite match successes : 16
% 0.13/10.44 % Condensation attempts : 0
% 0.13/10.44 % Condensation successes : 0
% 0.13/10.44 % Termbank termtop insertions : 5821
% 0.13/10.44 % Search garbage collected termcells : 2
% 0.13/10.44
% 0.13/10.44 % -------------------------------------------------
% 0.13/10.44 % User time : 0.004 s
% 0.13/10.44 % System time : 0.005 s
% 0.13/10.44 % Total time : 0.009 s
% 0.13/10.44 % Maximum resident set size: 3592 pages
% 0.13/10.44
% 0.13/10.44 % -------------------------------------------------
% 0.13/10.44 % User time : 0.025 s
% 0.13/10.44 % System time : 0.014 s
% 0.13/10.44 % Total time : 0.039 s
% 0.13/10.44 % Maximum resident set size: 4864 pages
% 0.13/10.44 % E exiting
%------------------------------------------------------------------------------