%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL162-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 : n005.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:55 PM UTC 2026
% Result : Unsatisfiable 7.47s 1.62s
% Output : CNFRefutation 7.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of clauses : 53 ( 53 unt; 0 nHn; 5 RR)
% Number of literals : 53 ( 52 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 93 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_6,axiom,
and_star(xor(truth,X1),X1) = falsehood,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_6) ).
cnf(and_star_commutativity,axiom,
and_star(X1,X2) = and_star(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_star_commutativity) ).
cnf(axiom_5,axiom,
and_star(X1,falsehood) = falsehood,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_5) ).
cnf(axiom_2,axiom,
xor(X1,falsehood) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_2) ).
cnf(xor_commutativity,axiom,
xor(X1,X2) = xor(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xor_commutativity) ).
cnf(implies_definition,axiom,
implies(X1,X2) = xor(truth,and_star(X1,xor(truth,X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
cnf(and_star_associativity,axiom,
and_star(and_star(X1,X2),X3) = and_star(X1,and_star(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_star_associativity) ).
cnf(axiom_7,axiom,
xor(X1,xor(truth,X2)) = xor(xor(X1,truth),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_7) ).
cnf(axiom_3,axiom,
xor(X1,X1) = falsehood,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_3) ).
cnf(axiom_8,axiom,
and_star(xor(and_star(xor(truth,X1),X2),truth),X2) = and_star(xor(and_star(xor(truth,X2),X1),truth),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_8) ).
cnf(axiom_4,axiom,
and_star(X1,truth) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-0.ax',axiom_4) ).
cnf(prove_wajsberg_axiom,negated_conjecture,
implies(implies(x,y),implies(implies(y,z),implies(x,z))) != truth,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_wajsberg_axiom) ).
cnf(c_0_12,axiom,
and_star(xor(truth,X1),X1) = falsehood,
axiom_6 ).
cnf(c_0_13,axiom,
and_star(X1,X2) = and_star(X2,X1),
and_star_commutativity ).
cnf(c_0_14,axiom,
and_star(X1,falsehood) = falsehood,
axiom_5 ).
cnf(c_0_15,axiom,
xor(X1,falsehood) = X1,
axiom_2 ).
cnf(c_0_16,axiom,
xor(X1,X2) = xor(X2,X1),
xor_commutativity ).
cnf(c_0_17,axiom,
implies(X1,X2) = xor(truth,and_star(X1,xor(truth,X2))),
implies_definition ).
cnf(c_0_18,axiom,
and_star(and_star(X1,X2),X3) = and_star(X1,and_star(X2,X3)),
and_star_associativity ).
cnf(c_0_19,plain,
and_star(X1,xor(truth,X1)) = falsehood,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_20,plain,
and_star(falsehood,X1) = falsehood,
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_21,axiom,
xor(X1,xor(truth,X2)) = xor(xor(X1,truth),X2),
axiom_7 ).
cnf(c_0_22,axiom,
xor(X1,X1) = falsehood,
axiom_3 ).
cnf(c_0_23,plain,
xor(falsehood,X1) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_24,plain,
xor(truth,and_star(xor(truth,X1),X2)) = implies(X2,X1),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_25,plain,
and_star(X1,and_star(xor(truth,X1),X2)) = falsehood,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_26,plain,
xor(truth,xor(truth,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_27,axiom,
and_star(xor(and_star(xor(truth,X1),X2),truth),X2) = and_star(xor(and_star(xor(truth,X2),X1),truth),X1),
axiom_8 ).
cnf(c_0_28,plain,
implies(and_star(X1,X2),X1) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_15]),c_0_26]) ).
cnf(c_0_29,plain,
and_star(X1,xor(truth,and_star(xor(truth,X2),X1))) = and_star(X2,xor(truth,and_star(xor(truth,X1),X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_16]),c_0_13]),c_0_16]),c_0_13]) ).
cnf(c_0_30,plain,
implies(and_star(X1,and_star(X2,X3)),and_star(X1,X2)) = truth,
inference(spm,[status(thm)],[c_0_28,c_0_18]) ).
cnf(c_0_31,plain,
and_star(X1,implies(X1,X2)) = and_star(X2,implies(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_24]),c_0_24]) ).
cnf(c_0_32,axiom,
and_star(X1,truth) = X1,
axiom_4 ).
cnf(c_0_33,plain,
implies(X1,xor(truth,X2)) = xor(truth,and_star(X1,X2)),
inference(spm,[status(thm)],[c_0_17,c_0_26]) ).
cnf(c_0_34,plain,
implies(and_star(X1,and_star(X2,implies(X2,X3))),and_star(X1,X3)) = truth,
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
and_star(X1,and_star(X2,xor(truth,X1))) = falsehood,
inference(spm,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_36,plain,
implies(X1,and_star(X2,xor(truth,X3))) = xor(truth,and_star(X1,implies(X2,X3))),
inference(spm,[status(thm)],[c_0_17,c_0_17]) ).
cnf(c_0_37,plain,
implies(X1,falsehood) = xor(truth,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_32]) ).
cnf(c_0_38,plain,
xor(truth,and_star(X1,and_star(X2,xor(truth,X3)))) = implies(and_star(X1,X2),X3),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_39,plain,
implies(X1,and_star(X1,X2)) = implies(implies(xor(truth,X2),X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_31]),c_0_33]),c_0_17]) ).
cnf(c_0_40,plain,
implies(X1,and_star(xor(truth,X2),X3)) = xor(truth,and_star(implies(X3,X2),X1)),
inference(spm,[status(thm)],[c_0_24,c_0_24]) ).
cnf(c_0_41,plain,
xor(truth,implies(X1,X2)) = and_star(X1,xor(truth,X2)),
inference(spm,[status(thm)],[c_0_26,c_0_17]) ).
cnf(c_0_42,negated_conjecture,
implies(implies(x,y),implies(implies(y,z),implies(x,z))) != truth,
inference(fof_simplification,[status(thm)],[prove_wajsberg_axiom]) ).
cnf(c_0_43,plain,
implies(and_star(X1,X2),and_star(X2,implies(X3,X1))) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37]),c_0_38]) ).
cnf(c_0_44,plain,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_17]),c_0_33]),c_0_24]) ).
cnf(c_0_45,plain,
implies(X1,implies(X2,X3)) = implies(and_star(X1,X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_41]),c_0_38]) ).
cnf(c_0_46,negated_conjecture,
implies(implies(x,y),implies(implies(y,z),implies(x,z))) != truth,
c_0_42 ).
cnf(c_0_47,plain,
and_star(X1,and_star(X2,X3)) = and_star(X2,and_star(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_13]),c_0_18]) ).
cnf(c_0_48,plain,
implies(and_star(X1,implies(X1,and_star(X2,X3))),X3) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_33]),c_0_36]),c_0_18]),c_0_24]) ).
cnf(c_0_49,plain,
and_star(implies(X1,X2),implies(implies(X2,X1),X1)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_44]),c_0_45]),c_0_28]),c_0_32]) ).
cnf(c_0_50,negated_conjecture,
implies(and_star(x,and_star(implies(x,y),implies(y,z))),z) != truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_45]),c_0_45]),c_0_18]),c_0_13]),c_0_47]) ).
cnf(c_0_51,plain,
implies(and_star(X1,and_star(implies(X1,X2),implies(X2,X3))),X3) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_45]),c_0_18]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL162-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.46 % Computer : n005.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Mon Sep 21 00:07:48 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.53 Running first-order theorem proving
% 0.25/0.53 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
% 7.47/1.62 % Version: 3.5.1
% 7.47/1.62 % Preprocessing class: FSSSSMSSSSSNFFN.
% 7.47/1.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.47/1.62 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 7.47/1.62 % Starting new_bool_3 with 300s (1) cores
% 7.47/1.62 % Starting new_bool_1 with 300s (1) cores
% 7.47/1.62 % Starting sh5l with 300s (1) cores
% 7.47/1.62 % sh5l with pid 2120265 completed with status 0
% 7.47/1.62 % Result found by sh5l
% 7.47/1.62 % Preprocessing class: FSSSSMSSSSSNFFN.
% 7.47/1.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.47/1.62 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 7.47/1.62 % Starting new_bool_3 with 300s (1) cores
% 7.47/1.62 % Starting new_bool_1 with 300s (1) cores
% 7.47/1.62 % Starting sh5l with 300s (1) cores
% 7.47/1.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 7.47/1.62 % SinE strategy is gf500_gu_R04_F100_L20000
% 7.47/1.62 % Search class: FUUPM-FFSF21-MFFFFFNN
% 7.47/1.62 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 7.47/1.62 % Starting SubtermCWHack with 28s (1) cores
% 7.47/1.62 % SubtermCWHack with pid 2120272 completed with status 0
% 7.47/1.62 % Result found by SubtermCWHack
% 7.47/1.62 % Preprocessing class: FSSSSMSSSSSNFFN.
% 7.47/1.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.47/1.62 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 7.47/1.62 % Starting new_bool_3 with 300s (1) cores
% 7.47/1.62 % Starting new_bool_1 with 300s (1) cores
% 7.47/1.62 % Starting sh5l with 300s (1) cores
% 7.47/1.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 7.47/1.62 % SinE strategy is gf500_gu_R04_F100_L20000
% 7.47/1.62 % Search class: FUUPM-FFSF21-MFFFFFNN
% 7.47/1.62 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 7.47/1.62 % Starting SubtermCWHack with 28s (1) cores
% 7.47/1.62 % Preprocessing time : 0.002 s
% 7.47/1.62
% 7.47/1.62 % Proof found!
% 7.47/1.62 % SZS status Unsatisfiable
% 7.47/1.62 % SZS output start CNFRefutation
% See solution above
% 7.47/1.62 % Parsed axioms : 14
% 7.47/1.62 % Removed by relevancy pruning/SinE : 0
% 7.47/1.62 % Initial clauses : 14
% 7.47/1.62 % Removed in clause preprocessing : 0
% 7.47/1.62 % Initial clauses in saturation : 14
% 7.47/1.62 % Processed clauses : 2226
% 7.47/1.62 % ...of these trivial : 1551
% 7.47/1.62 % ...subsumed : 378
% 7.47/1.62 % ...remaining for further processing : 297
% 7.47/1.62 % Other redundant clauses eliminated : 0
% 7.47/1.62 % Clauses deleted for lack of memory : 0
% 7.47/1.62 % Backward-subsumed : 0
% 7.47/1.62 % Backward-rewritten : 12
% 7.47/1.62 % Generated clauses : 66316
% 7.47/1.62 % ...of the previous two non-redundant : 26701
% 7.47/1.62 % ...aggressively subsumed : 0
% 7.47/1.62 % Contextual simplify-reflections : 0
% 7.47/1.62 % Paramodulations : 66316
% 7.47/1.62 % Factorizations : 0
% 7.47/1.62 % NegExts : 0
% 7.47/1.62 % Equation resolutions : 0
% 7.47/1.62 % Disequality decompositions : 0
% 7.47/1.62 % Total rewrite steps : 161542
% 7.47/1.62 % ...of those cached : 129686
% 7.47/1.62 % Propositional unsat checks : 0
% 7.47/1.62 % Propositional check models : 0
% 7.47/1.62 % Propositional check unsatisfiable : 0
% 7.47/1.62 % Propositional clauses : 0
% 7.47/1.62 % Propositional clauses after purity: 0
% 7.47/1.62 % Propositional unsat core size : 0
% 7.47/1.62 % Propositional preprocessing time : 0.000
% 7.47/1.62 % Propositional encoding time : 0.000
% 7.47/1.62 % Propositional solver time : 0.000
% 7.47/1.62 % Success case prop preproc time : 0.000
% 7.47/1.62 % Success case prop encoding time : 0.000
% 7.47/1.62 % Success case prop solver time : 0.000
% 7.47/1.62 % Current number of processed clauses : 285
% 7.47/1.62 % Positive orientable unit clauses : 263
% 7.47/1.62 % Positive unorientable unit clauses: 22
% 7.47/1.62 % Negative unit clauses : 0
% 7.47/1.62 % Non-unit-clauses : 0
% 7.47/1.62 % Current number of unprocessed clauses: 24373
% 7.47/1.62 % ...number of literals in the above : 24373
% 7.47/1.62 % Current number of archived formulas : 0
% 7.47/1.62 % Current number of archived clauses : 12
% 7.47/1.62 % Clause-clause subsumption calls (NU) : 0
% 7.47/1.62 % Rec. Clause-clause subsumption calls : 0
% 7.47/1.62 % Non-unit clause-clause subsumptions : 0
% 7.47/1.62 % Unit Clause-clause subsumption calls : 70
% 7.47/1.62 % Rewrite failures with RHS unbound : 0
% 7.47/1.62 % BW rewrite match attempts : 4030
% 7.47/1.62 % BW rewrite match successes : 157
% 7.47/1.62 % Condensation attempts : 0
% 7.47/1.62 % Condensation successes : 0
% 7.47/1.62 % Termbank termtop insertions : 760160
% 7.47/1.62 % Search garbage collected termcells : 2
% 7.47/1.62
% 7.47/1.62 % -------------------------------------------------
% 7.47/1.62 % User time : 0.985 s
% 7.47/1.62 % System time : 0.053 s
% 7.47/1.62 % Total time : 1.038 s
% 7.47/1.62 % Maximum resident set size: 3640 pages
% 7.47/1.62
% 7.47/1.62 % -------------------------------------------------
% 7.47/1.62 % User time : 0.986 s
% 7.47/1.62 % System time : 0.061 s
% 7.47/1.62 % Total time : 1.047 s
% 7.47/1.62 % Maximum resident set size: 4608 pages
% 7.47/1.62 % E exiting
%------------------------------------------------------------------------------