%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL638+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 : 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:13:12 PM UTC 2026
% Result : Theorem 0.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 20 ( 3 unt; 0 def)
% Number of atoms : 201 ( 0 equ)
% Maximal formula atoms : 56 ( 10 avg)
% Number of connectives : 391 ( 210 ~; 155 |; 26 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 101 ( 0 sgn 73 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(main,conjecture,
~ ? [X1] :
~ ( ! [X2] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| p1(X2)
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ! [X1] :
( ~ $true
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ( ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ( ! [X1] :
( ~ ! [X2] :
( ~ p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ! [X2] :
( ~ ! [X1] :
( ~ p1(X1)
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ( p1(X2)
& ~ ! [X1] :
( ~ ! [X2] :
( ~ p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ( ~ p1(X2)
& ~ ! [X1] :
( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
fof(c_0_1,negated_conjecture,
~ ~ ? [X1] :
~ ( ! [X2] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| p1(X2)
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ! [X1] :
( ~ $true
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ( ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ( ! [X1] :
( ~ ! [X2] :
( ~ p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ! [X2] :
( ~ ! [X1] :
( ~ p1(X1)
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ( p1(X2)
& ~ ! [X1] :
( ~ ! [X2] :
( ~ p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ( ~ p1(X2)
& ~ ! [X1] :
( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) ) ),
inference(assume_negation,[status(cth)],[main]) ).
fof(c_0_2,negated_conjecture,
~ ~ ? [X1] :
~ ( ! [X2] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
| p1(X2)
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ! [X1] :
( ~ $true
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ( ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ( ! [X1] :
( ~ ! [X2] :
( ~ p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ! [X2] :
( ~ ! [X1] :
( ~ p1(X1)
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ( p1(X2)
& ~ ! [X1] :
( ~ ! [X2] :
( ~ p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ( ~ p1(X2)
& ~ ! [X1] :
( ~ ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_conjecture,
! [X4,X5,X7,X8,X10,X11,X12,X15,X16,X17,X18,X20,X23] :
( ( p1(X23)
| ~ r1(esk8_0,X23) )
& ~ p1(esk8_0)
& r1(esk1_0,esk8_0)
& ( ~ r1(esk1_0,X20)
| $true )
& ( ~ r1(esk1_0,X20)
| r1(X20,esk7_1(X20)) )
& ( ~ r1(esk1_0,X16)
| p1(X18)
| ~ r1(X17,X18)
| ~ r1(X16,X17)
| ~ p1(esk6_1(X16)) )
& ( ~ r1(esk1_0,X16)
| p1(X18)
| ~ r1(X17,X18)
| ~ r1(X16,X17)
| r1(X16,esk6_1(X16)) )
& ( ~ r1(esk1_0,X10)
| ~ r1(X10,X11)
| ~ r1(X11,X12)
| p1(esk4_3(X10,X11,X12))
| ~ p1(X15)
| ~ r1(esk5_1(X10),X15) )
& ( ~ r1(esk1_0,X10)
| ~ r1(X10,X11)
| ~ r1(X11,X12)
| p1(esk4_3(X10,X11,X12))
| r1(X10,esk5_1(X10)) )
& ( ~ r1(esk1_0,X10)
| ~ r1(X10,X11)
| ~ r1(X11,X12)
| r1(X12,esk4_3(X10,X11,X12))
| ~ p1(X15)
| ~ r1(esk5_1(X10),X15) )
& ( ~ r1(esk1_0,X10)
| ~ r1(X10,X11)
| ~ r1(X11,X12)
| r1(X12,esk4_3(X10,X11,X12))
| r1(X10,esk5_1(X10)) )
& ( ~ r1(esk1_0,X7)
| ~ p1(X7)
| ~ r1(X7,X8)
| p1(esk3_2(X7,X8)) )
& ( ~ r1(esk1_0,X7)
| ~ p1(X7)
| ~ r1(X7,X8)
| r1(X8,esk3_2(X7,X8)) )
& ( ~ r1(esk1_0,X4)
| p1(X4)
| ~ r1(X4,X5)
| ~ p1(esk2_2(X4,X5)) )
& ( ~ r1(esk1_0,X4)
| p1(X4)
| ~ r1(X4,X5)
| r1(X5,esk2_2(X4,X5)) ) ),
inference(distribute,[status(thm)],[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,
( ~ r1(esk1_0,X1)
| ~ r1(X2,X3)
| ~ r1(X1,X2)
| p1(X3)
| r1(X1,esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
( ~ r1(esk1_0,X2)
| ~ r1(X2,X1)
| p1(X2)
| r1(X1,esk2_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ p1(esk2_2(X1,X2))
| p1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,negated_conjecture,
( ~ r1(X1,X3)
| ~ r1(X2,X3)
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| r1(X2,esk6_1(X2))
| p1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).
cnf(c_0_8,negated_conjecture,
( ~ r1(esk1_0,X1)
| r1(X1,esk7_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ r1(X2,X3)
| ~ r1(X1,X2)
| ~ p1(esk6_1(X1))
| p1(X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,negated_conjecture,
( ~ r1(esk8_0,X1)
| p1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(X1,esk7_1(X2))
| r1(X2,esk6_1(X2))
| p1(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( ~ r1(X2,X3)
| ~ r1(X3,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk8_0,esk6_1(X2))
| p1(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( ~ r1(esk1_0,X1)
| r1(X1,esk6_1(X1))
| p1(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_14,negated_conjecture,
r1(esk1_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_15,negated_conjecture,
~ p1(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_16,negated_conjecture,
( ~ r1(X2,X1)
| ~ r1(esk8_0,X2)
| p1(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),c_0_15]) ).
cnf(c_0_17,negated_conjecture,
( ~ r1(esk7_1(esk8_0),X1)
| p1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_8]),c_0_14])]) ).
cnf(c_0_18,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ r1(X1,esk7_1(esk8_0))
| p1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_5]),c_0_6]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_8]),c_0_14])]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL638+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.37 % Computer : n007.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Mon Sep 21 00:40:20 UTC 2026
% 0.13/0.37 % CPUTime :
% 0.13/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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.16/0.45 % Version: 3.5.1
% 0.16/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 % Starting sh5l with 300s (1) cores
% 0.16/0.45 % new_bool_1 with pid 3987354 completed with status 0
% 0.16/0.45 % Result found by new_bool_1
% 0.16/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 % Search class: FGUNF-FFSF31-SFFFFFNN
% 0.16/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.45 % SubtermCWHack with pid 3987356 completed with status 0
% 0.16/0.45 % Result found by SubtermCWHack
% 0.16/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 % Search class: FGUNF-FFSF31-SFFFFFNN
% 0.16/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.45 % Preprocessing time : 0.001 s
% 0.16/0.45
% 0.16/0.45 % Proof found!
% 0.16/0.45 % SZS status Theorem
% 0.16/0.45 % SZS output start CNFRefutation
% See solution above
% 0.16/0.45 % Parsed axioms : 1
% 0.16/0.45 % Removed by relevancy pruning/SinE : 0
% 0.16/0.45 % Initial clauses : 15
% 0.16/0.45 % Removed in clause preprocessing : 1
% 0.16/0.45 % Initial clauses in saturation : 14
% 0.16/0.45 % Processed clauses : 61
% 0.16/0.45 % ...of these trivial : 0
% 0.16/0.45 % ...subsumed : 8
% 0.16/0.45 % ...remaining for further processing : 53
% 0.16/0.45 % Other redundant clauses eliminated : 0
% 0.16/0.45 % Clauses deleted for lack of memory : 0
% 0.16/0.45 % Backward-subsumed : 8
% 0.16/0.45 % Backward-rewritten : 0
% 0.16/0.45 % Generated clauses : 105
% 0.16/0.45 % ...of the previous two non-redundant : 104
% 0.16/0.45 % ...aggressively subsumed : 0
% 0.16/0.45 % Contextual simplify-reflections : 3
% 0.16/0.45 % Paramodulations : 105
% 0.16/0.45 % Factorizations : 0
% 0.16/0.45 % NegExts : 0
% 0.16/0.45 % Equation resolutions : 0
% 0.16/0.45 % Disequality decompositions : 0
% 0.16/0.45 % Total rewrite steps : 12
% 0.16/0.45 % ...of those cached : 11
% 0.16/0.45 % Propositional unsat checks : 0
% 0.16/0.45 % Propositional check models : 0
% 0.16/0.45 % Propositional check unsatisfiable : 0
% 0.16/0.45 % Propositional clauses : 0
% 0.16/0.45 % Propositional clauses after purity: 0
% 0.16/0.45 % Propositional unsat core size : 0
% 0.16/0.45 % Propositional preprocessing time : 0.000
% 0.16/0.45 % Propositional encoding time : 0.000
% 0.16/0.45 % Propositional solver time : 0.000
% 0.16/0.45 % Success case prop preproc time : 0.000
% 0.16/0.45 % Success case prop encoding time : 0.000
% 0.16/0.45 % Success case prop solver time : 0.000
% 0.16/0.45 % Current number of processed clauses : 45
% 0.16/0.45 % Positive orientable unit clauses : 1
% 0.16/0.45 % Positive unorientable unit clauses: 0
% 0.16/0.45 % Negative unit clauses : 3
% 0.16/0.45 % Non-unit-clauses : 41
% 0.16/0.45 % Current number of unprocessed clauses: 51
% 0.16/0.45 % ...number of literals in the above : 326
% 0.16/0.45 % Current number of archived formulas : 0
% 0.16/0.45 % Current number of archived clauses : 8
% 0.16/0.45 % Clause-clause subsumption calls (NU) : 566
% 0.16/0.45 % Rec. Clause-clause subsumption calls : 294
% 0.16/0.45 % Non-unit clause-clause subsumptions : 8
% 0.16/0.45 % Unit Clause-clause subsumption calls : 11
% 0.16/0.45 % Rewrite failures with RHS unbound : 0
% 0.16/0.45 % BW rewrite match attempts : 0
% 0.16/0.45 % BW rewrite match successes : 0
% 0.16/0.45 % Condensation attempts : 0
% 0.16/0.45 % Condensation successes : 0
% 0.16/0.45 % Termbank termtop insertions : 3728
% 0.16/0.45 % Search garbage collected termcells : 363
% 0.16/0.45
% 0.16/0.45 % -------------------------------------------------
% 0.16/0.45 % User time : 0.006 s
% 0.16/0.45 % System time : 0.000 s
% 0.16/0.45 % Total time : 0.007 s
% 0.16/0.45 % Maximum resident set size: 3632 pages
% 0.16/0.45
% 0.16/0.45 % -------------------------------------------------
% 0.16/0.45 % User time : 0.006 s
% 0.16/0.45 % System time : 0.006 s
% 0.16/0.45 % Total time : 0.013 s
% 0.16/0.45 % Maximum resident set size: 4864 pages
% 0.16/0.45 % E exiting
%------------------------------------------------------------------------------