%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL109-2 : 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 : n019.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:18:29 PM UTC 2026
% Result : Unsatisfiable 11.61s 2.15s
% Output : CNFRefutation 11.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 5
% Syntax : Number of clauses : 43 ( 43 unt; 0 nHn; 5 RR)
% Number of literals : 43 ( 42 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 74 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
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_1,axiom,
implies(truth,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_1) ).
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(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(prove_wajsberg_mv_4,negated_conjecture,
implies(implies(implies(a,b),implies(b,a)),implies(b,a)) != truth,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_wajsberg_mv_4) ).
cnf(c_0_5,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
wajsberg_2 ).
cnf(c_0_6,axiom,
implies(truth,X1) = X1,
wajsberg_1 ).
cnf(c_0_7,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
wajsberg_3 ).
cnf(c_0_8,plain,
implies(X1,implies(implies(X1,X2),X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).
cnf(c_0_9,plain,
implies(implies(X1,truth),truth) = implies(X1,X1),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_10,plain,
implies(X1,X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_8]),c_0_6]) ).
cnf(c_0_11,plain,
implies(implies(X1,truth),truth) = truth,
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
implies(X1,truth) = truth,
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_13,plain,
implies(X1,implies(X2,X1)) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_12]),c_0_6]),c_0_6]) ).
cnf(c_0_14,axiom,
implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
wajsberg_4 ).
cnf(c_0_15,plain,
implies(implies(implies(X1,X2),X3),implies(X2,X3)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_13]),c_0_6]) ).
cnf(c_0_16,plain,
implies(implies(not(X1),not(truth)),X1) = truth,
inference(spm,[status(thm)],[c_0_14,c_0_6]) ).
cnf(c_0_17,plain,
implies(not(truth),X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_6]) ).
cnf(c_0_18,plain,
implies(not(X1),implies(X1,X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_6]) ).
cnf(c_0_19,plain,
implies(implies(X1,not(truth)),not(truth)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_17]),c_0_6]) ).
cnf(c_0_20,plain,
implies(not(implies(X1,not(truth))),X1) = truth,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
implies(X1,implies(not(X1),not(truth))) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_20]),c_0_6]) ).
cnf(c_0_22,plain,
implies(not(X1),not(truth)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_21]),c_0_6]),c_0_16]),c_0_6]) ).
cnf(c_0_23,plain,
implies(implies(implies(implies(X1,X2),implies(X3,X2)),X4),implies(implies(X3,X1),X4)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_5]),c_0_6]) ).
cnf(c_0_24,plain,
implies(implies(implies(implies(X1,X2),X2),X3),implies(X1,X3)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_8]),c_0_6]) ).
cnf(c_0_25,plain,
implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X3,X1)),implies(X3,X1)) = implies(implies(X1,X2),implies(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_5]),c_0_6]) ).
cnf(c_0_26,plain,
implies(X1,not(truth)) = not(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_22]),c_0_17]),c_0_6]) ).
cnf(c_0_27,plain,
implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3))) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_6]) ).
cnf(c_0_28,plain,
implies(not(X1),not(X2)) = implies(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_26]),c_0_14]),c_0_6]),c_0_26]) ).
cnf(c_0_29,plain,
not(not(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_26]),c_0_26]) ).
cnf(c_0_30,plain,
implies(X1,implies(X2,X3)) = implies(X2,implies(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_27]),c_0_6]),c_0_27]),c_0_6]) ).
cnf(c_0_31,plain,
implies(not(X1),X2) = implies(not(X2),X1),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
implies(X1,not(X2)) = implies(X2,not(X1)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
implies(implies(implies(a,b),implies(b,a)),implies(b,a)) != truth,
inference(fof_simplification,[status(thm)],[prove_wajsberg_mv_4]) ).
cnf(c_0_34,plain,
implies(implies(X1,implies(X2,X3)),implies(implies(implies(X3,X2),X2),implies(X1,X3))) = truth,
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_35,plain,
implies(not(X1),implies(X2,not(X3))) = implies(X2,implies(X3,X1)),
inference(spm,[status(thm)],[c_0_30,c_0_28]) ).
cnf(c_0_36,plain,
implies(implies(not(X1),X2),X1) = implies(X2,not(implies(X1,not(X2)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_31]),c_0_32]) ).
cnf(c_0_37,negated_conjecture,
implies(implies(implies(a,b),implies(b,a)),implies(b,a)) != truth,
c_0_33 ).
cnf(c_0_38,plain,
implies(X1,implies(implies(X2,implies(X1,X3)),implies(implies(implies(not(X1),X2),X2),X3))) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_28]),c_0_35]),c_0_30]),c_0_30]) ).
cnf(c_0_39,plain,
implies(implies(X1,not(X2)),not(implies(implies(not(X1),X2),X1))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_36]),c_0_31]),c_0_13]),c_0_6]),c_0_32]) ).
cnf(c_0_40,negated_conjecture,
implies(b,implies(implies(b,implies(implies(a,b),a)),a)) != truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_30]),c_0_30]) ).
cnf(c_0_41,plain,
implies(X1,implies(implies(X1,implies(implies(X2,X1),X2)),X2)) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_28]),c_0_31]),c_0_18]),c_0_28]),c_0_6]),c_0_35]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL109-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n019.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:05:21 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.42 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
% 11.61/2.15 % Version: 3.5.1
% 11.61/2.15 % Preprocessing class: FSSSSMSSSSSNFFN.
% 11.61/2.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.61/2.15 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 11.61/2.15 % Starting new_bool_3 with 300s (1) cores
% 11.61/2.15 % Starting new_bool_1 with 300s (1) cores
% 11.61/2.15 % Starting sh5l with 300s (1) cores
% 11.61/2.15 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1268981 completed with status 0
% 11.61/2.15 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 11.61/2.15 % Preprocessing class: FSSSSMSSSSSNFFN.
% 11.61/2.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.61/2.15 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 11.61/2.15 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.61/2.15 % No SInE strategy applied
% 11.61/2.15 % Search class: FUUPM-FFSF21-MFFFFFNN
% 11.61/2.15 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 11.61/2.15 % Starting SubtermCWHack with 136s (1) cores
% 11.61/2.15 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 11.61/2.15 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 11.61/2.15 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 11.61/2.15 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 11.61/2.15 % SubtermCWHack with pid 1268985 completed with status 0
% 11.61/2.15 % Result found by SubtermCWHack
% 11.61/2.15 % Preprocessing class: FSSSSMSSSSSNFFN.
% 11.61/2.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.61/2.15 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 11.61/2.15 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.61/2.15 % No SInE strategy applied
% 11.61/2.15 % Search class: FUUPM-FFSF21-MFFFFFNN
% 11.61/2.15 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 11.61/2.15 % Starting SubtermCWHack with 136s (1) cores
% 11.61/2.15 % Preprocessing time : 0.001 s
% 11.61/2.15
% 11.61/2.15 % Proof found!
% 11.61/2.15 % SZS status Unsatisfiable
% 11.61/2.15 % SZS output start CNFRefutation
% See solution above
% 11.61/2.15 % Parsed axioms : 5
% 11.61/2.15 % Removed by relevancy pruning/SinE : 0
% 11.61/2.15 % Initial clauses : 5
% 11.61/2.15 % Removed in clause preprocessing : 0
% 11.61/2.15 % Initial clauses in saturation : 5
% 11.61/2.15 % Processed clauses : 2074
% 11.61/2.15 % ...of these trivial : 1463
% 11.61/2.15 % ...subsumed : 298
% 11.61/2.15 % ...remaining for further processing : 313
% 11.61/2.15 % Other redundant clauses eliminated : 0
% 11.61/2.15 % Clauses deleted for lack of memory : 0
% 11.61/2.15 % Backward-subsumed : 0
% 11.61/2.15 % Backward-rewritten : 119
% 11.61/2.15 % Generated clauses : 144903
% 11.61/2.15 % ...of the previous two non-redundant : 58664
% 11.61/2.15 % ...aggressively subsumed : 0
% 11.61/2.15 % Contextual simplify-reflections : 0
% 11.61/2.15 % Paramodulations : 144903
% 11.61/2.15 % Factorizations : 0
% 11.61/2.15 % NegExts : 0
% 11.61/2.15 % Equation resolutions : 0
% 11.61/2.15 % Disequality decompositions : 0
% 11.61/2.15 % Total rewrite steps : 305172
% 11.61/2.15 % ...of those cached : 251422
% 11.61/2.15 % Propositional unsat checks : 0
% 11.61/2.15 % Propositional check models : 0
% 11.61/2.15 % Propositional check unsatisfiable : 0
% 11.61/2.15 % Propositional clauses : 0
% 11.61/2.15 % Propositional clauses after purity: 0
% 11.61/2.15 % Propositional unsat core size : 0
% 11.61/2.15 % Propositional preprocessing time : 0.000
% 11.61/2.15 % Propositional encoding time : 0.000
% 11.61/2.15 % Propositional solver time : 0.000
% 11.61/2.15 % Success case prop preproc time : 0.000
% 11.61/2.15 % Success case prop encoding time : 0.000
% 11.61/2.15 % Success case prop solver time : 0.000
% 11.61/2.15 % Current number of processed clauses : 194
% 11.61/2.15 % Positive orientable unit clauses : 181
% 11.61/2.15 % Positive unorientable unit clauses: 13
% 11.61/2.15 % Negative unit clauses : 0
% 11.61/2.15 % Non-unit-clauses : 0
% 11.61/2.15 % Current number of unprocessed clauses: 54863
% 11.61/2.15 % ...number of literals in the above : 54863
% 11.61/2.15 % Current number of archived formulas : 0
% 11.61/2.15 % Current number of archived clauses : 119
% 11.61/2.15 % Clause-clause subsumption calls (NU) : 0
% 11.61/2.15 % Rec. Clause-clause subsumption calls : 0
% 11.61/2.15 % Non-unit clause-clause subsumptions : 0
% 11.61/2.15 % Unit Clause-clause subsumption calls : 270
% 11.61/2.15 % Rewrite failures with RHS unbound : 0
% 11.61/2.15 % BW rewrite match attempts : 6300
% 11.61/2.15 % BW rewrite match successes : 670
% 11.61/2.15 % Condensation attempts : 0
% 11.61/2.15 % Condensation successes : 0
% 11.61/2.15 % Termbank termtop insertions : 2017601
% 11.61/2.15 % Search garbage collected termcells : 2
% 11.61/2.15
% 11.61/2.15 % -------------------------------------------------
% 11.61/2.15 % User time : 1.589 s
% 11.61/2.15 % System time : 0.073 s
% 11.61/2.15 % Total time : 1.662 s
% 11.61/2.15 % Maximum resident set size: 3584 pages
% 11.61/2.15
% 11.61/2.15 % -------------------------------------------------
% 11.61/2.15 % User time : 7.827 s
% 11.61/2.15 % System time : 0.326 s
% 11.61/2.15 % Total time : 8.153 s
% 11.61/2.15 % Maximum resident set size: 4608 pages
% 11.61/2.15 % E exiting
%------------------------------------------------------------------------------