%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL675+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:16:06 PM UTC 2026
% Result : CounterSatisfiable 0.26s 5.64s
% Output : Saturation 0.26s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_6ERROR: Could not build tree for root c_0_10ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_7,plain,
( ~ r1(X2,X3)
| ~ r1(X1,X2)
| r1(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]),
[final] ).
cnf(c_0_8,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ p100(X1)
| p101(X1)
| r1(X1,esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_9,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ p100(X1)
| p101(X1)
| r1(X1,esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_10,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ p101(X1)
| ~ p101(X2)
| ~ p2(X2)
| ~ r1(X1,X2)
| p2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_11,negated_conjecture,
( ~ r1(X2,X1)
| ~ r1(esk1_0,X1)
| ~ p100(X1)
| r1(X2,esk3_1(X1))
| p101(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]),
[final] ).
cnf(c_0_12,negated_conjecture,
( ~ r1(X2,X1)
| ~ r1(esk1_0,X1)
| ~ p100(X1)
| r1(X2,esk2_1(X1))
| p101(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_9]),
[final] ).
cnf(c_0_14,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ p100(X1)
| p101(X1)
| p2(esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_15,negated_conjecture,
( ~ r1(X3,X1)
| ~ r1(X2,X3)
| ~ r1(esk1_0,X1)
| ~ p100(X1)
| r1(X2,esk3_1(X1))
| p101(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_11]),
[final] ).
cnf(c_0_16,negated_conjecture,
( ~ r1(X3,X1)
| ~ r1(X2,X3)
| ~ r1(esk1_0,X1)
| ~ p100(X1)
| r1(X2,esk2_1(X1))
| p101(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_12]),
[final] ).
cnf(c_0_17,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ p100(X1)
| ~ p1(X1)
| ~ p100(X2)
| ~ r1(X1,X2)
| p1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_19,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ p100(X1)
| p101(X1)
| p101(esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_20,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ p100(X1)
| ~ p100(X2)
| ~ p1(X2)
| ~ r1(X1,X2)
| p1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_21,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ p101(X1)
| ~ p2(X1)
| ~ p101(X2)
| ~ r1(X1,X2)
| p2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_23,negated_conjecture,
( ~ r1(X3,X1)
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk2_1(X1),X2)
| ~ p100(X1)
| ~ p100(X2)
| r1(X3,esk3_1(X2))
| p101(X2)
| p101(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_12]),
[final] ).
cnf(c_0_24,negated_conjecture,
( ~ r1(X3,X1)
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk3_1(X1),X2)
| ~ p100(X1)
| ~ p100(X2)
| r1(X3,esk3_1(X2))
| p101(X2)
| p101(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_11]),
[final] ).
cnf(c_0_25,negated_conjecture,
( ~ r1(X3,X1)
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk2_1(X1),X2)
| ~ p100(X1)
| ~ p100(X2)
| r1(X3,esk2_1(X2))
| p101(X2)
| p101(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_12]),
[final] ).
cnf(c_0_26,negated_conjecture,
( ~ r1(X3,X1)
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk3_1(X1),X2)
| ~ p100(X1)
| ~ p100(X2)
| r1(X3,esk2_1(X2))
| p101(X2)
| p101(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_11]),
[final] ).
cnf(c_0_27,negated_conjecture,
( ~ r1(X2,X1)
| ~ r1(esk1_0,X2)
| ~ p100(X1)
| ~ p100(X2)
| ~ p100(esk3_1(X1))
| ~ p1(X2)
| p101(X1)
| p1(esk3_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_11]),c_0_7]),
[final] ).
cnf(c_0_28,negated_conjecture,
( ~ r1(X2,X1)
| ~ r1(esk1_0,X2)
| ~ p101(X2)
| ~ p100(X1)
| p2(X2)
| p101(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_7]),
[final] ).
cnf(c_0_29,negated_conjecture,
( ~ r1(X1,X2)
| ~ r1(esk1_0,X1)
| ~ p100(X2)
| ~ p100(X1)
| ~ p100(esk3_1(X2))
| ~ p1(esk3_1(X2))
| p101(X2)
| p1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_11]),c_0_7]),
[final] ).
cnf(c_0_30,negated_conjecture,
( ~ r1(X2,X1)
| ~ r1(esk1_0,X2)
| ~ p100(X1)
| ~ p100(X2)
| ~ p100(esk2_1(X1))
| ~ p1(X2)
| p101(X1)
| p1(esk2_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_12]),c_0_7]),
[final] ).
cnf(c_0_31,negated_conjecture,
( ~ r1(X2,X1)
| ~ r1(esk1_0,X2)
| ~ p2(X2)
| ~ p101(X2)
| ~ p101(esk2_1(X1))
| ~ p100(X1)
| p2(esk2_1(X1))
| p101(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_12]),c_0_7]),
[final] ).
cnf(c_0_32,negated_conjecture,
( ~ r1(X1,X2)
| ~ r1(esk1_0,X1)
| ~ p100(X2)
| ~ p100(X1)
| ~ p100(esk2_1(X2))
| ~ p1(esk2_1(X2))
| p101(X2)
| p1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_12]),c_0_7]),
[final] ).
cnf(c_0_33,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk2_1(X1),X2)
| ~ p100(X1)
| ~ p100(X2)
| r1(X1,esk3_1(X2))
| p101(X2)
| p101(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_9]),
[final] ).
cnf(c_0_34,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk3_1(X1),X2)
| ~ p100(X1)
| ~ p100(X2)
| r1(X1,esk3_1(X2))
| p101(X2)
| p101(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_8]),
[final] ).
cnf(c_0_35,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk2_1(X1),X2)
| ~ p100(X1)
| ~ p100(X2)
| r1(X1,esk2_1(X2))
| p101(X2)
| p101(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_9]),
[final] ).
cnf(c_0_36,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk3_1(X1),X2)
| ~ p100(X1)
| ~ p100(X2)
| r1(X1,esk2_1(X2))
| p101(X2)
| p101(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_8]),
[final] ).
cnf(c_0_37,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ p100(X1)
| ~ p100(esk2_1(X1))
| ~ p1(esk2_1(X1))
| p101(X1)
| p1(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_9]),
[final] ).
cnf(c_0_38,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ p100(X1)
| ~ p100(esk3_1(X1))
| ~ p1(esk3_1(X1))
| p101(X1)
| p1(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_8]),
[final] ).
cnf(c_0_39,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ p100(X1)
| ~ p100(esk2_1(X1))
| ~ p1(X1)
| p101(X1)
| p1(esk2_1(X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_9]),
[final] ).
cnf(c_0_40,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ p100(X1)
| ~ p100(esk3_1(X1))
| ~ p1(X1)
| p101(X1)
| p1(esk3_1(X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_8]),
[final] ).
cnf(c_0_41,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ p100(X1)
| ~ p102(esk3_1(X1))
| p101(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_42,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ p100(X1)
| ~ p102(esk2_1(X1))
| p101(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_43,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ p100(X1)
| ~ p2(esk2_1(X1))
| p101(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_44,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ p100(X1)
| p101(X1)
| p101(esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_45,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ p101(X1)
| p100(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_46,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ p102(X1)
| p101(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_47,negated_conjecture,
~ p101(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
cnf(c_0_48,plain,
r1(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_22]),
[final] ).
cnf(c_0_49,negated_conjecture,
p100(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL675+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/5.49 % Computer : n017.cluster.edu
% 0.21/5.49 % Model : x86_64 x86_64
% 0.21/5.49 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/5.49 % Memory : 8046.5625MB
% 0.21/5.49 % OS : Linux 6.8.0-71-generic
% 0.21/5.49 % CPULimit : 300
% 0.21/5.49 % WCLimit : 300
% 0.21/5.49 % DateTime : Mon Sep 21 00:49:18 UTC 2026
% 0.21/5.50 % CPUTime :
% 0.26/5.50 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/5.57 Running first-order theorem proving
% 0.26/5.57 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.26/5.64 % Version: 3.5.1
% 0.26/5.64 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/5.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/5.64 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/5.64 % Starting new_bool_3 with 300s (1) cores
% 0.26/5.64 % Starting new_bool_1 with 300s (1) cores
% 0.26/5.64 % Starting sh5l with 300s (1) cores
% 0.26/5.64 % new_bool_1 with pid 1059273 completed with status 1
% 0.26/5.64 % Result found by new_bool_1
% 0.26/5.64 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/5.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/5.64 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/5.64 % Starting new_bool_3 with 300s (1) cores
% 0.26/5.64 % Starting new_bool_1 with 300s (1) cores
% 0.26/5.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/5.64 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/5.64 % Search class: FGUNF-FFSF11-SFFFFFNN
% 0.26/5.64 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/5.64 % Starting SubtermCWHack with 31s (1) cores
% 0.26/5.64 % SubtermCWHack with pid 1059275 completed with status 1
% 0.26/5.64 % Result found by SubtermCWHack
% 0.26/5.64 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/5.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/5.64 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/5.64 % Starting new_bool_3 with 300s (1) cores
% 0.26/5.64 % Starting new_bool_1 with 300s (1) cores
% 0.26/5.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/5.64 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/5.64 % Search class: FGUNF-FFSF11-SFFFFFNN
% 0.26/5.64 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/5.64 % Starting SubtermCWHack with 31s (1) cores
% 0.26/5.64 % Preprocessing time : 0.002 s
% 0.26/5.64
% 0.26/5.64 % No proof found!
% 0.26/5.64 % SZS status CounterSatisfiable
% 0.26/5.64 % SZS output start Saturation
% See solution above
% 0.26/5.64 % Parsed axioms : 3
% 0.26/5.64 % Removed by relevancy pruning/SinE : 0
% 0.26/5.64 % Initial clauses : 18
% 0.26/5.64 % Removed in clause preprocessing : 0
% 0.26/5.64 % Initial clauses in saturation : 18
% 0.26/5.64 % Processed clauses : 102
% 0.26/5.64 % ...of these trivial : 0
% 0.26/5.64 % ...subsumed : 60
% 0.26/5.64 % ...remaining for further processing : 42
% 0.26/5.64 % Other redundant clauses eliminated : 0
% 0.26/5.64 % Clauses deleted for lack of memory : 0
% 0.26/5.64 % Backward-subsumed : 2
% 0.26/5.64 % Backward-rewritten : 0
% 0.26/5.64 % Generated clauses : 101
% 0.26/5.64 % ...of the previous two non-redundant : 84
% 0.26/5.64 % ...aggressively subsumed : 0
% 0.26/5.64 % Contextual simplify-reflections : 8
% 0.26/5.64 % Paramodulations : 101
% 0.26/5.64 % Factorizations : 0
% 0.26/5.64 % NegExts : 0
% 0.26/5.64 % Equation resolutions : 0
% 0.26/5.64 % Disequality decompositions : 0
% 0.26/5.64 % Total rewrite steps : 0
% 0.26/5.64 % ...of those cached : 0
% 0.26/5.64 % Propositional unsat checks : 0
% 0.26/5.64 % Propositional check models : 0
% 0.26/5.64 % Propositional check unsatisfiable : 0
% 0.26/5.64 % Propositional clauses : 0
% 0.26/5.64 % Propositional clauses after purity: 0
% 0.26/5.64 % Propositional unsat core size : 0
% 0.26/5.64 % Propositional preprocessing time : 0.000
% 0.26/5.64 % Propositional encoding time : 0.000
% 0.26/5.64 % Propositional solver time : 0.000
% 0.26/5.64 % Success case prop preproc time : 0.000
% 0.26/5.64 % Success case prop encoding time : 0.000
% 0.26/5.64 % Success case prop solver time : 0.000
% 0.26/5.64 % Current number of processed clauses : 40
% 0.26/5.64 % Positive orientable unit clauses : 2
% 0.26/5.64 % Positive unorientable unit clauses: 0
% 0.26/5.64 % Negative unit clauses : 1
% 0.26/5.64 % Non-unit-clauses : 37
% 0.26/5.64 % Current number of unprocessed clauses: 0
% 0.26/5.64 % ...number of literals in the above : 0
% 0.26/5.64 % Current number of archived formulas : 0
% 0.26/5.64 % Current number of archived clauses : 2
% 0.26/5.64 % Clause-clause subsumption calls (NU) : 798
% 0.26/5.64 % Rec. Clause-clause subsumption calls : 477
% 0.26/5.64 % Non-unit clause-clause subsumptions : 70
% 0.26/5.64 % Unit Clause-clause subsumption calls : 0
% 0.26/5.64 % Rewrite failures with RHS unbound : 0
% 0.26/5.64 % BW rewrite match attempts : 0
% 0.26/5.64 % BW rewrite match successes : 0
% 0.26/5.64 % Condensation attempts : 0
% 0.26/5.64 % Condensation successes : 0
% 0.26/5.64 % Termbank termtop insertions : 4594
% 0.26/5.64 % Search garbage collected termcells : 252
% 0.26/5.64
% 0.26/5.64 % -------------------------------------------------
% 0.26/5.64 % User time : 0.017 s
% 0.26/5.64 % System time : 0.005 s
% 0.26/5.64 % Total time : 0.023 s
% 0.26/5.64 % Maximum resident set size: 3636 pages
% 0.26/5.64
% 0.26/5.64 % -------------------------------------------------
% 0.26/5.64 % User time : 0.018 s
% 0.26/5.64 % System time : 0.014 s
% 0.26/5.64 % Total time : 0.032 s
% 0.26/5.64 % Maximum resident set size: 4864 pages
% 0.26/5.64 % E exiting
%------------------------------------------------------------------------------