%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL415-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 : n010.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 : Satisfiable 0.11s 0.46s
% Output : Saturation 0.11s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_3ERROR: Could not build tree for root c_0_15ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_4,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
c_0_3,
[final] ).
cnf(c_0_5,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,implies(implies(X3,X1),X4)),implies(X1,X4)))),
candidate,
[final] ).
cnf(c_0_6,plain,
( ~ is_a_theorem(implies(X3,X1))
| is_a_theorem(implies(implies(X1,implies(implies(X2,X3),X4)),implies(X3,X4))) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]),
[final] ).
cnf(c_0_7,plain,
( ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X3,implies(implies(X4,X1),X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_6]),
[final] ).
cnf(c_0_8,plain,
( ~ is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X4)))
| is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_7,c_0_5]),
[final] ).
cnf(c_0_9,plain,
( ~ is_a_theorem(implies(X2,implies(X1,X2)))
| is_a_theorem(implies(implies(implies(X1,X2),implies(implies(X3,X2),X4)),implies(X2,implies(implies(X3,X2),X4)))) ),
inference(spm,[status(thm)],[c_0_8,c_0_6]),
[final] ).
cnf(c_0_10,plain,
( ~ is_a_theorem(implies(X1,implies(X4,X1)))
| ~ is_a_theorem(implies(implies(X4,X1),implies(implies(X2,X1),X3)))
| is_a_theorem(implies(X1,implies(implies(X2,X1),X3))) ),
inference(spm,[status(thm)],[c_0_4,c_0_9]),
[final] ).
cnf(c_0_11,plain,
( ~ is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,implies(implies(X1,X2),X3))))
| is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(implies(implies(X1,X2),X3),implies(implies(X1,X2),X3)),implies(X2,X3)))) ),
inference(spm,[status(thm)],[c_0_10,c_0_5]),
[final] ).
cnf(c_0_12,plain,
( ~ is_a_theorem(implies(implies(X1,X2),X3))
| ~ is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,implies(implies(X1,X2),X3))))
| is_a_theorem(implies(implies(implies(implies(X1,X2),X3),implies(implies(X1,X2),X3)),implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_4,c_0_11]),
[final] ).
cnf(c_0_13,plain,
( ~ is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(implies(implies(X1,X2),X2),implies(X2,implies(implies(X1,X2),X2))))
| is_a_theorem(implies(implies(implies(implies(X1,X2),X2),implies(implies(X1,X2),X2)),implies(X2,implies(implies(X1,X2),X2)))) ),
inference(spm,[status(thm)],[c_0_8,c_0_12]),
[final] ).
cnf(c_0_15,plain,
( ~ is_a_theorem(implies(implies(X2,implies(X3,X1)),implies(X3,X1)))
| ~ is_a_theorem(implies(X1,implies(implies(implies(X2,implies(X3,X1)),implies(X3,X1)),implies(implies(X2,implies(X3,X1)),implies(X3,X1)))))
| ~ is_a_theorem(implies(implies(implies(X2,implies(X3,X1)),implies(X3,X1)),implies(implies(X3,X1),implies(implies(X2,implies(X3,X1)),implies(X3,X1)))))
| is_a_theorem(implies(X1,implies(implies(X2,implies(X3,X1)),implies(X3,X1)))) ),
inference(spm,[status(thm)],[c_0_7,c_0_13]),
[final] ).
cnf(c_0_16,plain,
( ~ is_a_theorem(implies(implies(X3,implies(X4,X1)),X2))
| ~ is_a_theorem(implies(X1,implies(implies(implies(X3,implies(X4,X1)),X2),implies(implies(X3,implies(X4,X1)),X2))))
| ~ is_a_theorem(implies(implies(implies(X3,implies(X4,X1)),X2),implies(implies(X4,X1),implies(implies(X3,implies(X4,X1)),X2))))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_12]),
[final] ).
cnf(c_0_17,plain,
( ~ is_a_theorem(implies(implies(X3,X1),X2))
| ~ is_a_theorem(implies(implies(implies(X3,X1),X2),implies(implies(X3,X1),X2)))
| ~ is_a_theorem(implies(implies(implies(X3,X1),X2),implies(X1,implies(implies(X3,X1),X2))))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_12]),
[final] ).
cnf(c_0_18,plain,
( ~ is_a_theorem(implies(implies(X3,X1),implies(X5,implies(X3,X1))))
| ~ is_a_theorem(implies(X1,implies(implies(X5,implies(X3,X1)),implies(implies(X2,implies(X3,X1)),X4))))
| is_a_theorem(implies(X1,implies(implies(X2,implies(X3,X1)),X4))) ),
inference(spm,[status(thm)],[c_0_7,c_0_9]),
[final] ).
cnf(c_0_19,plain,
( ~ is_a_theorem(implies(implies(X5,X1),X3))
| ~ is_a_theorem(implies(X1,implies(X3,implies(implies(X4,implies(X5,X1)),X2))))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_6]),
[final] ).
cnf(c_0_20,negated_conjecture,
~ is_a_theorem(implies(a,implies(b,a))),
c_0_14,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL415-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.39 % Computer : n010.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Mon Sep 21 00:30:09 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/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.11/0.46 % Version: 3.5.1
% 0.11/0.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.46 % Starting sh5l with 300s (1) cores
% 0.11/0.46 % new_bool_3 with pid 3870291 completed with status 1
% 0.11/0.46 % Result found by new_bool_3
% 0.11/0.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.46 % Search class: FHUNF-FFSF22-MFFFFFNN
% 0.11/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.46 % SubtermCWHack with pid 3870298 completed with status 1
% 0.11/0.46 % Result found by SubtermCWHack
% 0.11/0.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.46 % Search class: FHUNF-FFSF22-MFFFFFNN
% 0.11/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.46 % Preprocessing time : 0.001 s
% 0.11/0.46
% 0.11/0.46 % No proof found!
% 0.11/0.46 % SZS status Satisfiable
% 0.11/0.46 % SZS output start Saturation
% See solution above
% 0.11/0.46 % Parsed axioms : 3
% 0.11/0.46 % Removed by relevancy pruning/SinE : 0
% 0.11/0.46 % Initial clauses : 3
% 0.11/0.46 % Removed in clause preprocessing : 0
% 0.11/0.46 % Initial clauses in saturation : 3
% 0.11/0.46 % Processed clauses : 20
% 0.11/0.46 % ...of these trivial : 0
% 0.11/0.46 % ...subsumed : 4
% 0.11/0.46 % ...remaining for further processing : 16
% 0.11/0.46 % Other redundant clauses eliminated : 0
% 0.11/0.46 % Clauses deleted for lack of memory : 0
% 0.11/0.46 % Backward-subsumed : 0
% 0.11/0.46 % Backward-rewritten : 0
% 0.11/0.46 % Generated clauses : 17
% 0.11/0.46 % ...of the previous two non-redundant : 17
% 0.11/0.46 % ...aggressively subsumed : 0
% 0.11/0.46 % Contextual simplify-reflections : 0
% 0.11/0.46 % Paramodulations : 17
% 0.11/0.46 % Factorizations : 0
% 0.11/0.46 % NegExts : 0
% 0.11/0.46 % Equation resolutions : 0
% 0.11/0.46 % Disequality decompositions : 0
% 0.11/0.46 % Total rewrite steps : 0
% 0.11/0.46 % ...of those cached : 0
% 0.11/0.46 % Propositional unsat checks : 0
% 0.11/0.46 % Propositional check models : 0
% 0.11/0.46 % Propositional check unsatisfiable : 0
% 0.11/0.46 % Propositional clauses : 0
% 0.11/0.46 % Propositional clauses after purity: 0
% 0.11/0.46 % Propositional unsat core size : 0
% 0.11/0.46 % Propositional preprocessing time : 0.000
% 0.11/0.46 % Propositional encoding time : 0.000
% 0.11/0.46 % Propositional solver time : 0.000
% 0.11/0.46 % Success case prop preproc time : 0.000
% 0.11/0.46 % Success case prop encoding time : 0.000
% 0.11/0.46 % Success case prop solver time : 0.000
% 0.11/0.46 % Current number of processed clauses : 16
% 0.11/0.46 % Positive orientable unit clauses : 1
% 0.11/0.46 % Positive unorientable unit clauses: 0
% 0.11/0.46 % Negative unit clauses : 1
% 0.11/0.46 % Non-unit-clauses : 14
% 0.11/0.46 % Current number of unprocessed clauses: 0
% 0.11/0.46 % ...number of literals in the above : 0
% 0.11/0.46 % Current number of archived formulas : 0
% 0.11/0.46 % Current number of archived clauses : 0
% 0.11/0.46 % Clause-clause subsumption calls (NU) : 153
% 0.11/0.46 % Rec. Clause-clause subsumption calls : 147
% 0.11/0.46 % Non-unit clause-clause subsumptions : 4
% 0.11/0.46 % Unit Clause-clause subsumption calls : 0
% 0.11/0.46 % Rewrite failures with RHS unbound : 0
% 0.11/0.46 % BW rewrite match attempts : 0
% 0.11/0.46 % BW rewrite match successes : 0
% 0.11/0.46 % Condensation attempts : 0
% 0.11/0.46 % Condensation successes : 0
% 0.11/0.46 % Termbank termtop insertions : 908
% 0.11/0.46 % Search garbage collected termcells : 8
% 0.11/0.46
% 0.11/0.46 % -------------------------------------------------
% 0.11/0.46 % User time : 0.004 s
% 0.11/0.46 % System time : 0.002 s
% 0.11/0.46 % Total time : 0.006 s
% 0.11/0.46 % Maximum resident set size: 3632 pages
% 0.11/0.46
% 0.11/0.46 % -------------------------------------------------
% 0.11/0.46 % User time : 0.006 s
% 0.11/0.46 % System time : 0.007 s
% 0.11/0.46 % Total time : 0.012 s
% 0.11/0.46 % Maximum resident set size: 4864 pages
% 0.11/0.46 % E exiting
%------------------------------------------------------------------------------