%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL156-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 : n009.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.17s 0.57s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of clauses : 48 ( 48 unt; 0 nHn; 11 RR)
% Number of literals : 48 ( 47 equ; 6 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; 3 con; 0-2 aty)
% Number of variables : 61 ( 3 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(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(or_commutativity,axiom,
or(X1,X2) = or(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',or_commutativity) ).
cnf(or_definition,axiom,
or(X1,X2) = implies(not(X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',or_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_definition,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',and_definition) ).
cnf(prove_alternative_wajsberg_axiom,negated_conjecture,
and_star(x,truth) != x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_alternative_wajsberg_axiom) ).
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(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(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_commutativity,axiom,
and(X1,X2) = and(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',and_commutativity) ).
cnf(c_0_12,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
wajsberg_4 ).
cnf(c_0_13,axiom,
implies(truth,X1) = X1,
wajsberg_1 ).
cnf(c_0_14,axiom,
not(truth) = falsehood,
false_definition ).
cnf(c_0_15,axiom,
or(X1,X2) = or(X2,X1),
or_commutativity ).
cnf(c_0_16,axiom,
or(X1,X2) = implies(not(X1),X2),
or_definition ).
cnf(c_0_17,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
wajsberg_3 ).
cnf(c_0_18,plain,
implies(implies(not(X1),falsehood),X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_19,plain,
implies(not(X1),X2) = implies(not(X2),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).
cnf(c_0_20,plain,
implies(implies(X1,truth),truth) = implies(X1,X1),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_21,plain,
implies(implies(not(falsehood),X1),X1) = truth,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
implies(not(falsehood),not(falsehood)) = truth,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
not(falsehood) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_13]) ).
cnf(c_0_24,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_definition ).
cnf(c_0_25,plain,
implies(X1,X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_23]),c_0_13]) ).
cnf(c_0_26,negated_conjecture,
and_star(x,truth) != x,
inference(fof_simplification,[status(thm)],[prove_alternative_wajsberg_axiom]) ).
cnf(c_0_27,plain,
not(implies(not(not(X1)),not(X2))) = and(X1,X2),
inference(rw,[status(thm)],[c_0_24,c_0_16]) ).
cnf(c_0_28,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
wajsberg_2 ).
cnf(c_0_29,plain,
implies(implies(X1,truth),truth) = truth,
inference(rw,[status(thm)],[c_0_20,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
and_star(x,truth) != x,
c_0_26 ).
cnf(c_0_31,axiom,
and_star(X1,X2) = and_star(X2,X1),
and_star_commutativity ).
cnf(c_0_32,axiom,
and_star(X1,X2) = not(or(not(X1),not(X2))),
and_star_definition ).
cnf(c_0_33,plain,
not(implies(not(falsehood),not(X1))) = and(X1,truth),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_14]),c_0_19]) ).
cnf(c_0_34,plain,
implies(X1,implies(implies(X1,X2),X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_13]),c_0_13]) ).
cnf(c_0_35,plain,
implies(not(X1),truth) = implies(falsehood,X1),
inference(spm,[status(thm)],[c_0_19,c_0_14]) ).
cnf(c_0_36,plain,
implies(implies(falsehood,X1),truth) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_19]),c_0_14]) ).
cnf(c_0_37,negated_conjecture,
and_star(truth,x) != x,
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
and_star(X1,X2) = and(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_16]),c_0_27]) ).
cnf(c_0_39,axiom,
and(X1,X2) = and(X2,X1),
and_commutativity ).
cnf(c_0_40,plain,
and(X1,truth) = not(not(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_23]),c_0_13]) ).
cnf(c_0_41,plain,
implies(falsehood,X1) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_35]) ).
cnf(c_0_42,negated_conjecture,
and(truth,x) != x,
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,plain,
and(truth,X1) = not(not(X1)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
implies(implies(X1,falsehood),falsehood) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_41]),c_0_13]) ).
cnf(c_0_45,negated_conjecture,
not(not(x)) != x,
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
not(X1) = implies(X1,falsehood),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_19]),c_0_23]),c_0_13]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_46]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL156-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.11/0.51 % Computer : n009.cluster.edu
% 0.11/0.51 % Model : x86_64 x86_64
% 0.11/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.51 % Memory : 8046.5625MB
% 0.11/0.51 % OS : Linux 6.8.0-71-generic
% 0.11/0.51 % CPULimit : 300
% 0.11/0.51 % WCLimit : 300
% 0.11/0.51 % DateTime : Mon Sep 21 00:07:43 UTC 2026
% 0.11/0.51 % CPUTime :
% 0.11/0.51 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.55 Running first-order theorem proving
% 0.11/0.56 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.17/0.57 % Version: 3.5.1
% 0.17/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.57 % Starting sh5l with 300s (1) cores
% 0.17/0.57 % sh5l with pid 420390 completed with status 0
% 0.17/0.57 % Result found by sh5l
% 0.17/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.57 % Starting sh5l with 300s (1) cores
% 0.17/0.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.17/0.57 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.57 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.17/0.57 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.57 % Starting SubtermCWHack with 28s (1) cores
% 0.17/0.57 % SubtermCWHack with pid 420395 completed with status 0
% 0.17/0.57 % Result found by SubtermCWHack
% 0.17/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.57 % Starting sh5l with 300s (1) cores
% 0.17/0.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.17/0.57 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.57 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.17/0.57 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.57 % Starting SubtermCWHack with 28s (1) cores
% 0.17/0.57 % Preprocessing time : 0.001 s
% 0.17/0.57
% 0.17/0.57 % Proof found!
% 0.17/0.57 % SZS status Unsatisfiable
% 0.17/0.57 % SZS output start CNFRefutation
% See solution above
% 0.17/0.57 % Parsed axioms : 17
% 0.17/0.57 % Removed by relevancy pruning/SinE : 0
% 0.17/0.57 % Initial clauses : 17
% 0.17/0.57 % Removed in clause preprocessing : 0
% 0.17/0.57 % Initial clauses in saturation : 17
% 0.17/0.57 % Processed clauses : 73
% 0.17/0.57 % ...of these trivial : 13
% 0.17/0.57 % ...subsumed : 6
% 0.17/0.57 % ...remaining for further processing : 54
% 0.17/0.57 % Other redundant clauses eliminated : 0
% 0.17/0.57 % Clauses deleted for lack of memory : 0
% 0.17/0.57 % Backward-subsumed : 0
% 0.17/0.57 % Backward-rewritten : 36
% 0.17/0.57 % Generated clauses : 451
% 0.17/0.57 % ...of the previous two non-redundant : 323
% 0.17/0.57 % ...aggressively subsumed : 0
% 0.17/0.57 % Contextual simplify-reflections : 0
% 0.17/0.57 % Paramodulations : 451
% 0.17/0.57 % Factorizations : 0
% 0.17/0.57 % NegExts : 0
% 0.17/0.57 % Equation resolutions : 0
% 0.17/0.57 % Disequality decompositions : 0
% 0.17/0.57 % Total rewrite steps : 585
% 0.17/0.57 % ...of those cached : 418
% 0.17/0.57 % Propositional unsat checks : 0
% 0.17/0.57 % Propositional check models : 0
% 0.17/0.57 % Propositional check unsatisfiable : 0
% 0.17/0.57 % Propositional clauses : 0
% 0.17/0.57 % Propositional clauses after purity: 0
% 0.17/0.57 % Propositional unsat core size : 0
% 0.17/0.57 % Propositional preprocessing time : 0.000
% 0.17/0.57 % Propositional encoding time : 0.000
% 0.17/0.57 % Propositional solver time : 0.000
% 0.17/0.57 % Success case prop preproc time : 0.000
% 0.17/0.57 % Success case prop encoding time : 0.000
% 0.17/0.57 % Success case prop solver time : 0.000
% 0.17/0.57 % Current number of processed clauses : 18
% 0.17/0.57 % Positive orientable unit clauses : 15
% 0.17/0.57 % Positive unorientable unit clauses: 3
% 0.17/0.57 % Negative unit clauses : 0
% 0.17/0.57 % Non-unit-clauses : 0
% 0.17/0.57 % Current number of unprocessed clauses: 248
% 0.17/0.57 % ...number of literals in the above : 248
% 0.17/0.57 % Current number of archived formulas : 0
% 0.17/0.57 % Current number of archived clauses : 36
% 0.17/0.57 % Clause-clause subsumption calls (NU) : 0
% 0.17/0.57 % Rec. Clause-clause subsumption calls : 0
% 0.17/0.57 % Non-unit clause-clause subsumptions : 0
% 0.17/0.57 % Unit Clause-clause subsumption calls : 1
% 0.17/0.57 % Rewrite failures with RHS unbound : 0
% 0.17/0.57 % BW rewrite match attempts : 80
% 0.17/0.57 % BW rewrite match successes : 36
% 0.17/0.57 % Condensation attempts : 0
% 0.17/0.57 % Condensation successes : 0
% 0.17/0.57 % Termbank termtop insertions : 4642
% 0.17/0.57 % Search garbage collected termcells : 2
% 0.17/0.57
% 0.17/0.57 % -------------------------------------------------
% 0.17/0.57 % User time : 0.006 s
% 0.17/0.57 % System time : 0.000 s
% 0.17/0.57 % Total time : 0.007 s
% 0.17/0.57 % Maximum resident set size: 3644 pages
% 0.17/0.57
% 0.17/0.57 % -------------------------------------------------
% 0.17/0.57 % User time : 0.006 s
% 0.17/0.57 % System time : 0.004 s
% 0.17/0.57 % Total time : 0.010 s
% 0.17/0.57 % Maximum resident set size: 4608 pages
% 0.17/0.57 % E exiting
%------------------------------------------------------------------------------