%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL111-2 : 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 : 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:11:48 PM UTC 2026
% Result : Unsatisfiable 0.20s 0.47s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 4 RR)
% Number of literals : 25 ( 24 equ; 3 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 48 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
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(wajsberg_1,axiom,
implies(truth,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_1) ).
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(prove_mv_25,negated_conjecture,
implies(implies(x,y),implies(implies(z,x),implies(z,y))) != truth,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_mv_25) ).
cnf(c_0_4,axiom,
implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
wajsberg_2 ).
cnf(c_0_5,axiom,
implies(truth,X1) = X1,
wajsberg_1 ).
cnf(c_0_6,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
wajsberg_3 ).
cnf(c_0_7,plain,
implies(X1,implies(implies(X1,X2),X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_5]) ).
cnf(c_0_8,plain,
implies(implies(X1,truth),truth) = implies(X1,X1),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_9,plain,
implies(X1,X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_7]),c_0_5]) ).
cnf(c_0_10,plain,
implies(implies(X1,truth),truth) = truth,
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
implies(X1,truth) = truth,
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_12,plain,
implies(X1,implies(X2,X1)) = truth,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_11]),c_0_5]),c_0_5]) ).
cnf(c_0_13,plain,
implies(implies(implies(X1,X2),X3),implies(X2,X3)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_12]),c_0_5]) ).
cnf(c_0_14,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_4,c_0_4]),c_0_5]) ).
cnf(c_0_15,plain,
implies(implies(implies(implies(X1,X2),X2),X3),implies(X1,X3)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_7]),c_0_5]) ).
cnf(c_0_16,plain,
implies(X1,implies(X2,implies(X3,X1))) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_12]),c_0_5]) ).
cnf(c_0_17,negated_conjecture,
implies(implies(x,y),implies(implies(z,x),implies(z,y))) != truth,
inference(fof_simplification,[status(thm)],[prove_mv_25]) ).
cnf(c_0_18,plain,
implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3))) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_5]) ).
cnf(c_0_19,plain,
implies(X1,implies(X2,implies(implies(X1,X3),X3))) = truth,
inference(spm,[status(thm)],[c_0_16,c_0_6]) ).
cnf(c_0_20,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_6,c_0_4]),c_0_5]) ).
cnf(c_0_21,negated_conjecture,
implies(implies(x,y),implies(implies(z,x),implies(z,y))) != truth,
c_0_17 ).
cnf(c_0_22,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_6,c_0_18]),c_0_5]),c_0_18]),c_0_5]) ).
cnf(c_0_23,plain,
implies(X1,implies(implies(X2,X3),implies(implies(X1,X2),X3))) = truth,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL111-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.39 % Computer : n019.cluster.edu
% 0.14/0.39 % Model : x86_64 x86_64
% 0.14/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.39 % Memory : 8046.5625MB
% 0.14/0.39 % OS : Linux 6.8.0-71-generic
% 0.14/0.39 % CPULimit : 300
% 0.14/0.39 % WCLimit : 300
% 0.14/0.39 % DateTime : Mon Sep 21 00:05:36 UTC 2026
% 0.14/0.39 % CPUTime :
% 0.14/0.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/0.43 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.20/0.47 % Version: 3.5.1
% 0.20/0.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.47 % Starting sh5l with 300s (1) cores
% 0.20/0.47 % new_bool_3 with pid 1269761 completed with status 0
% 0.20/0.47 % Result found by new_bool_3
% 0.20/0.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.20/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.47 % Search class: FUUPS-FFSF22-MFFFFFNN
% 0.20/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.20/0.47 % SubtermCWHack with pid 1269766 completed with status 0
% 0.20/0.47 % Result found by SubtermCWHack
% 0.20/0.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.20/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.47 % Search class: FUUPS-FFSF22-MFFFFFNN
% 0.20/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.20/0.47 % Preprocessing time : 0.001 s
% 0.20/0.47
% 0.20/0.47 % Proof found!
% 0.20/0.47 % SZS status Unsatisfiable
% 0.20/0.47 % SZS output start CNFRefutation
% See solution above
% 0.20/0.47 % Parsed axioms : 5
% 0.20/0.47 % Removed by relevancy pruning/SinE : 1
% 0.20/0.47 % Initial clauses : 4
% 0.20/0.47 % Removed in clause preprocessing : 0
% 0.20/0.47 % Initial clauses in saturation : 4
% 0.20/0.47 % Processed clauses : 111
% 0.20/0.47 % ...of these trivial : 66
% 0.20/0.47 % ...subsumed : 3
% 0.20/0.47 % ...remaining for further processing : 42
% 0.20/0.47 % Other redundant clauses eliminated : 0
% 0.20/0.47 % Clauses deleted for lack of memory : 0
% 0.20/0.47 % Backward-subsumed : 0
% 0.20/0.47 % Backward-rewritten : 15
% 0.20/0.47 % Generated clauses : 4450
% 0.20/0.47 % ...of the previous two non-redundant : 1520
% 0.20/0.47 % ...aggressively subsumed : 0
% 0.20/0.47 % Contextual simplify-reflections : 0
% 0.20/0.47 % Paramodulations : 4450
% 0.20/0.47 % Factorizations : 0
% 0.20/0.47 % NegExts : 0
% 0.20/0.47 % Equation resolutions : 0
% 0.20/0.47 % Disequality decompositions : 0
% 0.20/0.47 % Total rewrite steps : 7321
% 0.20/0.47 % ...of those cached : 5448
% 0.20/0.47 % Propositional unsat checks : 0
% 0.20/0.47 % Propositional check models : 0
% 0.20/0.47 % Propositional check unsatisfiable : 0
% 0.20/0.47 % Propositional clauses : 0
% 0.20/0.47 % Propositional clauses after purity: 0
% 0.20/0.47 % Propositional unsat core size : 0
% 0.20/0.47 % Propositional preprocessing time : 0.000
% 0.20/0.47 % Propositional encoding time : 0.000
% 0.20/0.47 % Propositional solver time : 0.000
% 0.20/0.47 % Success case prop preproc time : 0.000
% 0.20/0.47 % Success case prop encoding time : 0.000
% 0.20/0.47 % Success case prop solver time : 0.000
% 0.20/0.47 % Current number of processed clauses : 27
% 0.20/0.47 % Positive orientable unit clauses : 25
% 0.20/0.47 % Positive unorientable unit clauses: 2
% 0.20/0.47 % Negative unit clauses : 0
% 0.20/0.47 % Non-unit-clauses : 0
% 0.20/0.47 % Current number of unprocessed clauses: 1391
% 0.20/0.47 % ...number of literals in the above : 1391
% 0.20/0.47 % Current number of archived formulas : 0
% 0.20/0.47 % Current number of archived clauses : 15
% 0.20/0.47 % Clause-clause subsumption calls (NU) : 0
% 0.20/0.47 % Rec. Clause-clause subsumption calls : 0
% 0.20/0.47 % Non-unit clause-clause subsumptions : 0
% 0.20/0.47 % Unit Clause-clause subsumption calls : 20
% 0.20/0.47 % Rewrite failures with RHS unbound : 0
% 0.20/0.47 % BW rewrite match attempts : 311
% 0.20/0.47 % BW rewrite match successes : 117
% 0.20/0.47 % Condensation attempts : 0
% 0.20/0.47 % Condensation successes : 0
% 0.20/0.47 % Termbank termtop insertions : 43708
% 0.20/0.47 % Search garbage collected termcells : 7
% 0.20/0.47
% 0.20/0.47 % -------------------------------------------------
% 0.20/0.47 % User time : 0.022 s
% 0.20/0.47 % System time : 0.001 s
% 0.20/0.47 % Total time : 0.024 s
% 0.20/0.47 % Maximum resident set size: 3636 pages
% 0.20/0.47
% 0.20/0.47 % -------------------------------------------------
% 0.20/0.47 % User time : 0.024 s
% 0.20/0.47 % System time : 0.003 s
% 0.20/0.47 % Total time : 0.027 s
% 0.20/0.47 % Maximum resident set size: 4608 pages
% 0.20/0.47 % E exiting
%------------------------------------------------------------------------------