%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL116-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 : n012.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:32 PM UTC 2026
% Result : Unsatisfiable 0.09s 0.44s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 5
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 4 RR)
% Number of literals : 31 ( 30 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; 3 con; 0-2 aty)
% Number of variables : 45 ( 6 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(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(prove_mv_50,negated_conjecture,
implies(not(a),implies(b,not(implies(b,a)))) != truth,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_mv_50) ).
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,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_8,axiom,
implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
wajsberg_3 ).
cnf(c_0_9,plain,
implies(X1,implies(implies(X2,X1),X1)) = truth,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
implies(X1,X1) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_6]) ).
cnf(c_0_11,plain,
implies(X1,truth) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_6]),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_5,c_0_11]),c_0_6]),c_0_6]) ).
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_5,c_0_12]),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(not(X1),implies(X1,X2)) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_6]) ).
cnf(c_0_16,plain,
implies(not(truth),X1) = truth,
inference(spm,[status(thm)],[c_0_15,c_0_6]) ).
cnf(c_0_17,plain,
implies(implies(X1,not(truth)),not(truth)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_16]),c_0_6]) ).
cnf(c_0_18,plain,
implies(not(implies(X1,not(truth))),X1) = truth,
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_19,plain,
implies(X1,implies(not(X1),not(truth))) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_18]),c_0_6]) ).
cnf(c_0_20,plain,
implies(implies(not(X1),not(truth)),X1) = truth,
inference(spm,[status(thm)],[c_0_14,c_0_6]) ).
cnf(c_0_21,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_8,c_0_19]),c_0_6]),c_0_20]),c_0_6]) ).
cnf(c_0_22,plain,
implies(X1,not(truth)) = not(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_21]),c_0_16]),c_0_6]) ).
cnf(c_0_23,plain,
implies(implies(X1,X2),implies(not(X2),not(X1))) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_22]),c_0_22]) ).
cnf(c_0_24,plain,
implies(not(X1),not(X2)) = implies(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_23]),c_0_6]),c_0_14]),c_0_6]) ).
cnf(c_0_25,plain,
not(not(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_22]),c_0_22]) ).
cnf(c_0_26,negated_conjecture,
implies(not(a),implies(b,not(implies(b,a)))) != truth,
inference(fof_simplification,[status(thm)],[prove_mv_50]) ).
cnf(c_0_27,plain,
implies(X1,not(X2)) = implies(X2,not(X1)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
implies(not(a),implies(b,not(implies(b,a)))) != truth,
c_0_26 ).
cnf(c_0_29,plain,
implies(not(X1),implies(X2,not(implies(X2,X1)))) = truth,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_24]),c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL116-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n012.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 00:06:08 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.09/0.44 % Version: 3.5.1
% 0.09/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.09/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.44 % Starting sh5l with 300s (1) cores
% 0.09/0.44 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1195561 completed with status 0
% 0.09/0.44 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.09/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.09/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.44 % No SInE strategy applied
% 0.09/0.44 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.09/0.44 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.09/0.44 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.09/0.44 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.09/0.44 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.09/0.44 % G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with pid 1195565 completed with status 0
% 0.09/0.44 % Result found by G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y
% 0.09/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.09/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.44 % No SInE strategy applied
% 0.09/0.44 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.09/0.44 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.09/0.44 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.09/0.44 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.09/0.44 % Preprocessing time : 0.001 s
% 0.09/0.44
% 0.09/0.44 % Proof found!
% 0.09/0.44 % SZS status Unsatisfiable
% 0.09/0.44 % SZS output start CNFRefutation
% See solution above
% 0.09/0.44 % Parsed axioms : 5
% 0.09/0.44 % Removed by relevancy pruning/SinE : 0
% 0.09/0.44 % Initial clauses : 5
% 0.09/0.44 % Removed in clause preprocessing : 0
% 0.09/0.44 % Initial clauses in saturation : 5
% 0.09/0.44 % Processed clauses : 92
% 0.09/0.44 % ...of these trivial : 50
% 0.09/0.44 % ...subsumed : 0
% 0.09/0.44 % ...remaining for further processing : 42
% 0.09/0.44 % Other redundant clauses eliminated : 0
% 0.09/0.44 % Clauses deleted for lack of memory : 0
% 0.09/0.44 % Backward-subsumed : 0
% 0.09/0.44 % Backward-rewritten : 13
% 0.09/0.44 % Generated clauses : 1650
% 0.09/0.44 % ...of the previous two non-redundant : 505
% 0.09/0.44 % ...aggressively subsumed : 0
% 0.09/0.44 % Contextual simplify-reflections : 0
% 0.09/0.44 % Paramodulations : 1650
% 0.09/0.44 % Factorizations : 0
% 0.09/0.44 % NegExts : 0
% 0.09/0.44 % Equation resolutions : 0
% 0.09/0.44 % Disequality decompositions : 0
% 0.09/0.44 % Total rewrite steps : 2128
% 0.09/0.44 % ...of those cached : 1650
% 0.09/0.44 % Propositional unsat checks : 0
% 0.09/0.44 % Propositional check models : 0
% 0.09/0.44 % Propositional check unsatisfiable : 0
% 0.09/0.44 % Propositional clauses : 0
% 0.09/0.44 % Propositional clauses after purity: 0
% 0.09/0.44 % Propositional unsat core size : 0
% 0.09/0.44 % Propositional preprocessing time : 0.000
% 0.09/0.44 % Propositional encoding time : 0.000
% 0.09/0.44 % Propositional solver time : 0.000
% 0.09/0.44 % Success case prop preproc time : 0.000
% 0.09/0.44 % Success case prop encoding time : 0.000
% 0.09/0.44 % Success case prop solver time : 0.000
% 0.09/0.44 % Current number of processed clauses : 29
% 0.09/0.44 % Positive orientable unit clauses : 26
% 0.09/0.44 % Positive unorientable unit clauses: 3
% 0.09/0.44 % Negative unit clauses : 0
% 0.09/0.44 % Non-unit-clauses : 0
% 0.09/0.44 % Current number of unprocessed clauses: 380
% 0.09/0.44 % ...number of literals in the above : 380
% 0.09/0.44 % Current number of archived formulas : 0
% 0.09/0.44 % Current number of archived clauses : 13
% 0.09/0.44 % Clause-clause subsumption calls (NU) : 0
% 0.09/0.44 % Rec. Clause-clause subsumption calls : 0
% 0.09/0.44 % Non-unit clause-clause subsumptions : 0
% 0.09/0.44 % Unit Clause-clause subsumption calls : 3
% 0.09/0.44 % Rewrite failures with RHS unbound : 0
% 0.09/0.44 % BW rewrite match attempts : 94
% 0.09/0.44 % BW rewrite match successes : 35
% 0.09/0.44 % Condensation attempts : 92
% 0.09/0.44 % Condensation successes : 0
% 0.09/0.44 % Termbank termtop insertions : 12067
% 0.09/0.44 % Search garbage collected termcells : 2
% 0.09/0.44
% 0.09/0.44 % -------------------------------------------------
% 0.09/0.44 % User time : 0.011 s
% 0.09/0.44 % System time : 0.003 s
% 0.09/0.44 % Total time : 0.014 s
% 0.09/0.44 % Maximum resident set size: 3584 pages
% 0.09/0.44
% 0.09/0.44 % -------------------------------------------------
% 0.09/0.44 % User time : 0.038 s
% 0.09/0.44 % System time : 0.015 s
% 0.09/0.44 % Total time : 0.052 s
% 0.09/0.44 % Maximum resident set size: 4864 pages
% 0.09/0.44 % E exiting
%------------------------------------------------------------------------------