%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL674+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 : n003.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:05 PM UTC 2026
% Result : Theorem 0.11s 0.43s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 14 ( 6 unt; 0 def)
% Number of atoms : 197 ( 0 equ)
% Maximal formula atoms : 66 ( 14 avg)
% Number of connectives : 342 ( 159 ~; 125 |; 58 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 40 ( 0 sgn 32 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(main,conjecture,
~ ? [X1] :
~ ( ~ ( p100(X1)
& ~ p101(X1)
& ! [X2] :
( ( ( ~ p101(X2)
| p100(X2) )
& ( ~ p102(X2)
| p101(X2) )
& ( ~ p100(X2)
| ( ( ~ p1(X2)
| ! [X1] :
( ~ p100(X1)
| p1(X1)
| ~ r1(X2,X1) ) )
& ( p1(X2)
| ! [X1] :
( ~ p100(X1)
| ~ p1(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ p101(X2)
| ( ( ~ p2(X2)
| ! [X1] :
( ~ p101(X1)
| p2(X1)
| ~ r1(X2,X1) ) )
& ( p2(X2)
| ! [X1] :
( ~ p101(X1)
| ~ p2(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ ( p100(X2)
& ~ p101(X2) )
| ( ~ ! [X1] :
( ~ ( p101(X1)
& ~ p102(X1)
& p2(X1) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ( p101(X1)
& ~ p102(X1)
& ~ p2(X1) )
| ~ r1(X2,X1) ) ) ) )
| ~ r1(X1,X2) ) )
| ~ ! [X2] :
( p2(X2)
| ~ r1(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
fof(reflexivity,axiom,
! [X1] : r1(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity) ).
fof(c_0_2,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ( p100(X1)
& ~ p101(X1)
& ! [X2] :
( ( ( ~ p101(X2)
| p100(X2) )
& ( ~ p102(X2)
| p101(X2) )
& ( ~ p100(X2)
| ( ( ~ p1(X2)
| ! [X1] :
( ~ p100(X1)
| p1(X1)
| ~ r1(X2,X1) ) )
& ( p1(X2)
| ! [X1] :
( ~ p100(X1)
| ~ p1(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ p101(X2)
| ( ( ~ p2(X2)
| ! [X1] :
( ~ p101(X1)
| p2(X1)
| ~ r1(X2,X1) ) )
& ( p2(X2)
| ! [X1] :
( ~ p101(X1)
| ~ p2(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ ( p100(X2)
& ~ p101(X2) )
| ( ~ ! [X1] :
( ~ ( p101(X1)
& ~ p102(X1)
& p2(X1) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ( p101(X1)
& ~ p102(X1)
& ~ p2(X1) )
| ~ r1(X2,X1) ) ) ) )
| ~ r1(X1,X2) ) )
| ~ ! [X2] :
( p2(X2)
| ~ r1(X1,X2) ) ),
inference(assume_negation,[status(cth)],[main]) ).
fof(c_0_3,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ( p100(X1)
& ~ p101(X1)
& ! [X2] :
( ( ( ~ p101(X2)
| p100(X2) )
& ( ~ p102(X2)
| p101(X2) )
& ( ~ p100(X2)
| ( ( ~ p1(X2)
| ! [X1] :
( ~ p100(X1)
| p1(X1)
| ~ r1(X2,X1) ) )
& ( p1(X2)
| ! [X1] :
( ~ p100(X1)
| ~ p1(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ p101(X2)
| ( ( ~ p2(X2)
| ! [X1] :
( ~ p101(X1)
| p2(X1)
| ~ r1(X2,X1) ) )
& ( p2(X2)
| ! [X1] :
( ~ p101(X1)
| ~ p2(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ ( p100(X2)
& ~ p101(X2) )
| ( ~ ! [X1] :
( ~ ( p101(X1)
& ~ p102(X1)
& p2(X1) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ( p101(X1)
& ~ p102(X1)
& ~ p2(X1) )
| ~ r1(X2,X1) ) ) ) )
| ~ r1(X1,X2) ) )
| ~ ! [X2] :
( p2(X2)
| ~ r1(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_4,negated_conjecture,
! [X9,X10,X13,X14,X15,X16] :
( p100(esk1_0)
& ~ p101(esk1_0)
& ( ~ r1(esk1_0,X10)
| ~ p101(X10)
| p100(X10) )
& ( ~ r1(esk1_0,X10)
| ~ p102(X10)
| p101(X10) )
& ( ~ r1(esk1_0,X10)
| ~ p100(X10)
| ~ p1(X10)
| ~ p100(X16)
| p1(X16)
| ~ r1(X10,X16) )
& ( ~ r1(esk1_0,X10)
| ~ p100(X10)
| p1(X10)
| ~ p100(X15)
| ~ p1(X15)
| ~ r1(X10,X15) )
& ( ~ r1(esk1_0,X10)
| ~ p101(X10)
| ~ p2(X10)
| ~ p101(X14)
| p2(X14)
| ~ r1(X10,X14) )
& ( ~ r1(esk1_0,X10)
| ~ p101(X10)
| p2(X10)
| ~ p101(X13)
| ~ p2(X13)
| ~ r1(X10,X13) )
& ( ~ r1(esk1_0,X10)
| ~ p100(X10)
| p101(X10)
| p101(esk3_1(X10)) )
& ( ~ r1(esk1_0,X10)
| ~ p100(X10)
| p101(X10)
| ~ p102(esk3_1(X10)) )
& ( ~ r1(esk1_0,X10)
| ~ p100(X10)
| p101(X10)
| p2(esk3_1(X10)) )
& ( ~ r1(esk1_0,X10)
| ~ p100(X10)
| p101(X10)
| r1(X10,esk3_1(X10)) )
& ( ~ r1(esk1_0,X10)
| ~ p100(X10)
| p101(X10)
| p101(esk2_1(X10)) )
& ( ~ r1(esk1_0,X10)
| ~ p100(X10)
| p101(X10)
| ~ p102(esk2_1(X10)) )
& ( ~ r1(esk1_0,X10)
| ~ p100(X10)
| p101(X10)
| ~ p2(esk2_1(X10)) )
& ( ~ r1(esk1_0,X10)
| ~ p100(X10)
| p101(X10)
| r1(X10,esk2_1(X10)) )
& ( p2(X9)
| ~ r1(esk1_0,X9) ) ),
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_3])])])])])]) ).
cnf(c_0_5,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ p100(X1)
| ~ p2(esk2_1(X1))
| p101(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,negated_conjecture,
( ~ r1(esk1_0,X1)
| p2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_7,plain,
! [X4] : r1(X4,X4),
inference(variable_rename,[status(thm)],[reflexivity]) ).
cnf(c_0_8,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ r1(esk1_0,esk2_1(X1))
| ~ p100(X1)
| p101(X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
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_4]) ).
cnf(c_0_10,negated_conjecture,
p100(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,plain,
r1(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
~ p101(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL674+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.11/0.37 % Computer : n003.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 00:54:46 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/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.11/0.43 % Version: 3.5.1
% 0.11/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43 % Starting sh5l with 300s (1) cores
% 0.11/0.43 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3046779 completed with status 0
% 0.11/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.43 % No SInE strategy applied
% 0.11/0.43 % Search class: FGUNF-FFSF11-SFFFFFNN
% 0.11/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.43 % Starting SAT001_CA_MinMin_p005000_rr with 136s (1) cores
% 0.11/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 136s (1) cores
% 0.11/0.43 % SubtermCWHack with pid 3046783 completed with status 0
% 0.11/0.43 % Result found by SubtermCWHack
% 0.11/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.43 % No SInE strategy applied
% 0.11/0.43 % Search class: FGUNF-FFSF11-SFFFFFNN
% 0.11/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.43 % Preprocessing time : 0.001 s
% 0.11/0.43
% 0.11/0.43 % Proof found!
% 0.11/0.43 % SZS status Theorem
% 0.11/0.43 % SZS output start CNFRefutation
% See solution above
% 0.11/0.43 % Parsed axioms : 3
% 0.11/0.43 % Removed by relevancy pruning/SinE : 0
% 0.11/0.43 % Initial clauses : 19
% 0.11/0.43 % Removed in clause preprocessing : 0
% 0.11/0.43 % Initial clauses in saturation : 19
% 0.11/0.43 % Processed clauses : 16
% 0.11/0.43 % ...of these trivial : 0
% 0.11/0.43 % ...subsumed : 0
% 0.11/0.43 % ...remaining for further processing : 16
% 0.11/0.43 % Other redundant clauses eliminated : 0
% 0.11/0.43 % Clauses deleted for lack of memory : 0
% 0.11/0.43 % Backward-subsumed : 0
% 0.11/0.43 % Backward-rewritten : 0
% 0.11/0.43 % Generated clauses : 5
% 0.11/0.43 % ...of the previous two non-redundant : 3
% 0.11/0.43 % ...aggressively subsumed : 0
% 0.11/0.43 % Contextual simplify-reflections : 0
% 0.11/0.43 % Paramodulations : 5
% 0.11/0.43 % Factorizations : 0
% 0.11/0.43 % NegExts : 0
% 0.11/0.43 % Equation resolutions : 0
% 0.11/0.43 % Disequality decompositions : 0
% 0.11/0.43 % Total rewrite steps : 2
% 0.11/0.43 % ...of those cached : 0
% 0.11/0.43 % Propositional unsat checks : 0
% 0.11/0.43 % Propositional check models : 0
% 0.11/0.43 % Propositional check unsatisfiable : 0
% 0.11/0.43 % Propositional clauses : 0
% 0.11/0.43 % Propositional clauses after purity: 0
% 0.11/0.43 % Propositional unsat core size : 0
% 0.11/0.43 % Propositional preprocessing time : 0.000
% 0.11/0.43 % Propositional encoding time : 0.000
% 0.11/0.43 % Propositional solver time : 0.000
% 0.11/0.43 % Success case prop preproc time : 0.000
% 0.11/0.43 % Success case prop encoding time : 0.000
% 0.11/0.43 % Success case prop solver time : 0.000
% 0.11/0.43 % Current number of processed clauses : 16
% 0.11/0.43 % Positive orientable unit clauses : 2
% 0.11/0.43 % Positive unorientable unit clauses: 0
% 0.11/0.43 % Negative unit clauses : 1
% 0.11/0.43 % Non-unit-clauses : 13
% 0.11/0.43 % Current number of unprocessed clauses: 6
% 0.11/0.43 % ...number of literals in the above : 34
% 0.11/0.43 % Current number of archived formulas : 0
% 0.11/0.43 % Current number of archived clauses : 0
% 0.11/0.43 % Clause-clause subsumption calls (NU) : 11
% 0.11/0.43 % Rec. Clause-clause subsumption calls : 9
% 0.11/0.43 % Non-unit clause-clause subsumptions : 0
% 0.11/0.43 % Unit Clause-clause subsumption calls : 0
% 0.11/0.43 % Rewrite failures with RHS unbound : 0
% 0.11/0.43 % BW rewrite match attempts : 0
% 0.11/0.43 % BW rewrite match successes : 0
% 0.11/0.43 % Condensation attempts : 0
% 0.11/0.43 % Condensation successes : 0
% 0.11/0.43 % Termbank termtop insertions : 1672
% 0.11/0.43 % Search garbage collected termcells : 270
% 0.11/0.43
% 0.11/0.43 % -------------------------------------------------
% 0.11/0.43 % User time : 0.001 s
% 0.11/0.43 % System time : 0.005 s
% 0.11/0.43 % Total time : 0.006 s
% 0.11/0.43 % Maximum resident set size: 3584 pages
% 0.11/0.43
% 0.11/0.43 % -------------------------------------------------
% 0.11/0.43 % User time : 0.011 s
% 0.11/0.43 % System time : 0.014 s
% 0.11/0.43 % Total time : 0.025 s
% 0.11/0.43 % Maximum resident set size: 4864 pages
% 0.11/0.43 % E exiting
%------------------------------------------------------------------------------