%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL414+1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:12:41 PM UTC 2026
% Result : Theorem 0.14s 0.47s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 5 unt; 0 def)
% Number of atoms : 43 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 54 ( 24 ~; 14 |; 16 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 55 ( 2 sgn 36 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thm147,conjecture,
~ ( ? [X4] : ~ a_truth(implies(X4,X4))
& ! [X1,X2] : a_truth(implies(implies(not(X1),not(X2)),implies(X2,X1)))
& ! [X1,X2,X3] : a_truth(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3))))
& ! [X1,X2] : a_truth(implies(X1,implies(X2,X1)))
& ! [X1,X2] :
( a_truth(X2)
| ~ a_truth(X1)
| ~ a_truth(implies(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm147) ).
fof(c_0_1,negated_conjecture,
~ ~ ( ? [X4] : ~ a_truth(implies(X4,X4))
& ! [X1,X2] : a_truth(implies(implies(not(X1),not(X2)),implies(X2,X1)))
& ! [X1,X2,X3] : a_truth(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3))))
& ! [X1,X2] : a_truth(implies(X1,implies(X2,X1)))
& ! [X1,X2] :
( a_truth(X2)
| ~ a_truth(X1)
| ~ a_truth(implies(X1,X2)) ) ),
inference(assume_negation,[status(cth)],[thm147]) ).
fof(c_0_2,negated_conjecture,
~ ~ ( ? [X4] : ~ a_truth(implies(X4,X4))
& ! [X1,X2] : a_truth(implies(implies(not(X1),not(X2)),implies(X2,X1)))
& ! [X1,X2,X3] : a_truth(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3))))
& ! [X1,X2] : a_truth(implies(X1,implies(X2,X1)))
& ! [X1,X2] :
( a_truth(X2)
| ~ a_truth(X1)
| ~ a_truth(implies(X1,X2)) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_conjecture,
! [X5,X6,X7,X8,X9,X10,X11,X12,X13] :
( ~ a_truth(implies(esk1_0,esk1_0))
& a_truth(implies(implies(not(X12),not(X13)),implies(X13,X12)))
& a_truth(implies(implies(X9,implies(X10,X11)),implies(implies(X9,X10),implies(X9,X11))))
& a_truth(implies(X7,implies(X8,X7)))
& ( a_truth(X6)
| ~ a_truth(X5)
| ~ a_truth(implies(X5,X6)) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])]) ).
cnf(c_0_4,negated_conjecture,
( ~ a_truth(X1)
| ~ a_truth(implies(X1,X2))
| a_truth(X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
a_truth(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( ~ a_truth(implies(X1,implies(X2,X3)))
| a_truth(implies(implies(X1,X2),implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,negated_conjecture,
( ~ a_truth(implies(X1,X3))
| ~ a_truth(implies(X1,implies(X3,X2)))
| a_truth(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_6]) ).
cnf(c_0_8,negated_conjecture,
a_truth(implies(X1,implies(X2,X1))),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
( ~ a_truth(implies(X1,X2))
| a_truth(implies(X1,X1)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,negated_conjecture,
~ a_truth(implies(esk1_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,negated_conjecture,
a_truth(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL414+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n007.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 00:27:20 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.44 Running first-order theorem proving
% 0.14/0.44 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
% 0.14/0.47 % Version: 3.5.1
% 0.14/0.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.47 % Starting sh5l with 300s (1) cores
% 0.14/0.47 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3965024 completed with status 0
% 0.14/0.47 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.14/0.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.47 % No SInE strategy applied
% 0.14/0.47 % Search class: FHUNS-FFSF21-MFFFFFNN
% 0.14/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.47 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.14/0.47 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 0.14/0.47 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.47 % H----_011_C07_F1_PI_SE_SP_S0V with pid 3965033 completed with status 0
% 0.14/0.47 % Result found by H----_011_C07_F1_PI_SE_SP_S0V
% 0.14/0.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.47 % No SInE strategy applied
% 0.14/0.47 % Search class: FHUNS-FFSF21-MFFFFFNN
% 0.14/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.47 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.14/0.47 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 0.14/0.47 % Preprocessing time : 0.001 s
% 0.14/0.47
% 0.14/0.47 % Proof found!
% 0.14/0.47 % SZS status Theorem
% 0.14/0.47 % SZS output start CNFRefutation
% See solution above
% 0.14/0.47 % Parsed axioms : 1
% 0.14/0.47 % Removed by relevancy pruning/SinE : 0
% 0.14/0.47 % Initial clauses : 5
% 0.14/0.47 % Removed in clause preprocessing : 0
% 0.14/0.47 % Initial clauses in saturation : 5
% 0.14/0.47 % Processed clauses : 20
% 0.14/0.47 % ...of these trivial : 0
% 0.14/0.47 % ...subsumed : 0
% 0.14/0.47 % ...remaining for further processing : 20
% 0.14/0.47 % Other redundant clauses eliminated : 0
% 0.14/0.47 % Clauses deleted for lack of memory : 0
% 0.14/0.47 % Backward-subsumed : 1
% 0.14/0.47 % Backward-rewritten : 1
% 0.14/0.47 % Generated clauses : 37
% 0.14/0.47 % ...of the previous two non-redundant : 33
% 0.14/0.47 % ...aggressively subsumed : 0
% 0.14/0.47 % Contextual simplify-reflections : 0
% 0.14/0.47 % Paramodulations : 37
% 0.14/0.47 % Factorizations : 0
% 0.14/0.47 % NegExts : 0
% 0.14/0.47 % Equation resolutions : 0
% 0.14/0.47 % Disequality decompositions : 0
% 0.14/0.47 % Total rewrite steps : 1
% 0.14/0.47 % ...of those cached : 0
% 0.14/0.47 % Propositional unsat checks : 0
% 0.14/0.47 % Propositional check models : 0
% 0.14/0.47 % Propositional check unsatisfiable : 0
% 0.14/0.47 % Propositional clauses : 0
% 0.14/0.47 % Propositional clauses after purity: 0
% 0.14/0.47 % Propositional unsat core size : 0
% 0.14/0.47 % Propositional preprocessing time : 0.000
% 0.14/0.47 % Propositional encoding time : 0.000
% 0.14/0.47 % Propositional solver time : 0.000
% 0.14/0.47 % Success case prop preproc time : 0.000
% 0.14/0.47 % Success case prop encoding time : 0.000
% 0.14/0.47 % Success case prop solver time : 0.000
% 0.14/0.47 % Current number of processed clauses : 18
% 0.14/0.47 % Positive orientable unit clauses : 4
% 0.14/0.47 % Positive unorientable unit clauses: 0
% 0.14/0.47 % Negative unit clauses : 2
% 0.14/0.47 % Non-unit-clauses : 12
% 0.14/0.47 % Current number of unprocessed clauses: 18
% 0.14/0.47 % ...number of literals in the above : 41
% 0.14/0.47 % Current number of archived formulas : 0
% 0.14/0.47 % Current number of archived clauses : 2
% 0.14/0.47 % Clause-clause subsumption calls (NU) : 59
% 0.14/0.47 % Rec. Clause-clause subsumption calls : 39
% 0.14/0.47 % Non-unit clause-clause subsumptions : 0
% 0.14/0.47 % Unit Clause-clause subsumption calls : 12
% 0.14/0.47 % Rewrite failures with RHS unbound : 0
% 0.14/0.47 % BW rewrite match attempts : 13
% 0.14/0.47 % BW rewrite match successes : 2
% 0.14/0.47 % Condensation attempts : 0
% 0.14/0.47 % Condensation successes : 0
% 0.14/0.47 % Termbank termtop insertions : 873
% 0.14/0.47 % Search garbage collected termcells : 39
% 0.14/0.47
% 0.14/0.47 % -------------------------------------------------
% 0.14/0.47 % User time : 0.004 s
% 0.14/0.47 % System time : 0.004 s
% 0.14/0.47 % Total time : 0.008 s
% 0.14/0.47 % Maximum resident set size: 3632 pages
% 0.14/0.47
% 0.14/0.47 % -------------------------------------------------
% 0.14/0.47 % User time : 0.016 s
% 0.14/0.47 % System time : 0.014 s
% 0.14/0.47 % Total time : 0.030 s
% 0.14/0.47 % Maximum resident set size: 4864 pages
% 0.14/0.47 % E exiting
%------------------------------------------------------------------------------