%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL164-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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 0.14s 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 26 ( 26 unt; 0 nHn; 5 RR)
% Number of literals : 26 ( 25 equ; 4 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_2,axiom,
xor(X1,falsehood) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-0.ax',axiom_2) ).
cnf(xor_commutativity,axiom,
xor(X1,X2) = xor(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xor_commutativity) ).
cnf(prove_wajsberg_axiom,negated_conjecture,
implies(implies(not(x),not(y)),implies(y,x)) != truth,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_wajsberg_axiom) ).
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_3,axiom,
xor(X1,X1) = falsehood,
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-0.ax',axiom_3) ).
cnf(axiom_6,axiom,
and_star(xor(truth,X1),X1) = falsehood,
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-0.ax',axiom_6) ).
cnf(and_star_commutativity,axiom,
and_star(X1,X2) = and_star(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_star_commutativity) ).
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(c_0_9,axiom,
xor(X1,falsehood) = X1,
axiom_2 ).
cnf(c_0_10,axiom,
xor(X1,X2) = xor(X2,X1),
xor_commutativity ).
cnf(c_0_11,negated_conjecture,
implies(implies(not(x),not(y)),implies(y,x)) != truth,
inference(fof_simplification,[status(thm)],[prove_wajsberg_axiom]) ).
cnf(c_0_12,axiom,
xor(X1,xor(truth,X2)) = xor(xor(X1,truth),X2),
axiom_7 ).
cnf(c_0_13,axiom,
xor(X1,X1) = falsehood,
axiom_3 ).
cnf(c_0_14,plain,
xor(falsehood,X1) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,axiom,
and_star(xor(truth,X1),X1) = falsehood,
axiom_6 ).
cnf(c_0_16,axiom,
and_star(X1,X2) = and_star(X2,X1),
and_star_commutativity ).
cnf(c_0_17,negated_conjecture,
implies(implies(not(x),not(y)),implies(y,x)) != truth,
c_0_11 ).
cnf(c_0_18,axiom,
not(X1) = xor(X1,truth),
axiom_1 ).
cnf(c_0_19,axiom,
implies(X1,X2) = xor(truth,and_star(X1,xor(truth,X2))),
implies_definition ).
cnf(c_0_20,plain,
xor(truth,xor(truth,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_21,plain,
and_star(X1,xor(truth,X1)) = falsehood,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
implies(implies(xor(truth,x),xor(truth,y)),implies(y,x)) != truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_10]),c_0_18]),c_0_10]) ).
cnf(c_0_23,plain,
implies(X1,xor(truth,X2)) = xor(truth,and_star(X1,X2)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
implies(X1,X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_21]),c_0_9]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_16]),c_0_19]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL164-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n001.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 00:13:43 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.14/0.43 % Version: 3.5.1
% 0.14/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % new_bool_3 with pid 1785652 completed with status 0
% 0.14/0.43 % Result found by new_bool_3
% 0.14/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.14/0.43 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.43 % SubtermCWHack with pid 1785657 completed with status 0
% 0.14/0.43 % Result found by SubtermCWHack
% 0.14/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.14/0.43 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.43 % Preprocessing time : 0.001 s
% 0.14/0.43
% 0.14/0.43 % Proof found!
% 0.14/0.43 % SZS status Unsatisfiable
% 0.14/0.43 % SZS output start CNFRefutation
% See solution above
% 0.14/0.43 % Parsed axioms : 14
% 0.14/0.43 % Removed by relevancy pruning/SinE : 0
% 0.14/0.43 % Initial clauses : 14
% 0.14/0.43 % Removed in clause preprocessing : 0
% 0.14/0.43 % Initial clauses in saturation : 14
% 0.14/0.43 % Processed clauses : 97
% 0.14/0.43 % ...of these trivial : 32
% 0.14/0.43 % ...subsumed : 23
% 0.14/0.43 % ...remaining for further processing : 42
% 0.14/0.43 % Other redundant clauses eliminated : 0
% 0.14/0.43 % Clauses deleted for lack of memory : 0
% 0.14/0.43 % Backward-subsumed : 0
% 0.14/0.43 % Backward-rewritten : 6
% 0.14/0.43 % Generated clauses : 661
% 0.14/0.43 % ...of the previous two non-redundant : 329
% 0.14/0.43 % ...aggressively subsumed : 0
% 0.14/0.43 % Contextual simplify-reflections : 0
% 0.14/0.43 % Paramodulations : 661
% 0.14/0.43 % Factorizations : 0
% 0.14/0.43 % NegExts : 0
% 0.14/0.43 % Equation resolutions : 0
% 0.14/0.43 % Disequality decompositions : 0
% 0.14/0.43 % Total rewrite steps : 978
% 0.14/0.43 % ...of those cached : 796
% 0.14/0.43 % Propositional unsat checks : 0
% 0.14/0.43 % Propositional check models : 0
% 0.14/0.43 % Propositional check unsatisfiable : 0
% 0.14/0.43 % Propositional clauses : 0
% 0.14/0.43 % Propositional clauses after purity: 0
% 0.14/0.43 % Propositional unsat core size : 0
% 0.14/0.43 % Propositional preprocessing time : 0.000
% 0.14/0.43 % Propositional encoding time : 0.000
% 0.14/0.43 % Propositional solver time : 0.000
% 0.14/0.43 % Success case prop preproc time : 0.000
% 0.14/0.43 % Success case prop encoding time : 0.000
% 0.14/0.43 % Success case prop solver time : 0.000
% 0.14/0.43 % Current number of processed clauses : 36
% 0.14/0.43 % Positive orientable unit clauses : 30
% 0.14/0.43 % Positive unorientable unit clauses: 6
% 0.14/0.43 % Negative unit clauses : 0
% 0.14/0.43 % Non-unit-clauses : 0
% 0.14/0.43 % Current number of unprocessed clauses: 246
% 0.14/0.43 % ...number of literals in the above : 246
% 0.14/0.43 % Current number of archived formulas : 0
% 0.14/0.43 % Current number of archived clauses : 6
% 0.14/0.43 % Clause-clause subsumption calls (NU) : 0
% 0.14/0.43 % Rec. Clause-clause subsumption calls : 0
% 0.14/0.43 % Non-unit clause-clause subsumptions : 0
% 0.14/0.43 % Unit Clause-clause subsumption calls : 7
% 0.14/0.43 % Rewrite failures with RHS unbound : 0
% 0.14/0.43 % BW rewrite match attempts : 61
% 0.14/0.43 % BW rewrite match successes : 49
% 0.14/0.43 % Condensation attempts : 0
% 0.14/0.43 % Condensation successes : 0
% 0.14/0.43 % Termbank termtop insertions : 6270
% 0.14/0.43 % Search garbage collected termcells : 2
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.002 s
% 0.14/0.43 % System time : 0.005 s
% 0.14/0.43 % Total time : 0.007 s
% 0.14/0.43 % Maximum resident set size: 3640 pages
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.003 s
% 0.14/0.43 % System time : 0.010 s
% 0.14/0.43 % Total time : 0.013 s
% 0.14/0.43 % Maximum resident set size: 4864 pages
% 0.14/0.43 % E exiting
%------------------------------------------------------------------------------