%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRA010+2 : TPTP v9.3.1. Bugfixed v3.2.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 12:31:52 PM UTC 2026
% Result : Theorem 0.09s 0.44s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 19 ( 8 unt; 0 def)
% Number of atoms : 66 ( 13 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 69 ( 22 ~; 24 |; 15 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 2 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 42 ( 11 sgn 21 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(complete_means_sequential_pairs_and_triangles,conjecture,
( complete
=> ! [X4,X2,X3] :
( ( ! [X7,X8] :
( ( sequential(X7,X8)
& on_path(X8,X4)
& on_path(X7,X4) )
=> ? [X9] : triangle(X7,X8,X9) )
& path(X2,X3,X4) )
=> number_of_in(sequential_pairs,X4) = number_of_in(triangles,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complete_means_sequential_pairs_and_triangles) ).
fof(sequential_pairs_and_triangles,axiom,
! [X4,X2,X3] :
( ( ! [X7,X8] :
( ( sequential(X7,X8)
& on_path(X8,X4)
& on_path(X7,X4) )
=> ? [X9] : triangle(X7,X8,X9) )
& path(X2,X3,X4) )
=> number_of_in(sequential_pairs,X4) = number_of_in(triangles,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sequential_pairs_and_triangles) ).
fof(c_0_2,negated_conjecture,
~ ( complete
=> ! [X4,X2,X3] :
( ( ! [X7,X8] :
( ( sequential(X7,X8)
& on_path(X8,X4)
& on_path(X7,X4) )
=> ? [X9] : triangle(X7,X8,X9) )
& path(X2,X3,X4) )
=> number_of_in(sequential_pairs,X4) = number_of_in(triangles,X4) ) ),
inference(assume_negation,[status(cth)],[complete_means_sequential_pairs_and_triangles]) ).
fof(c_0_3,plain,
! [X76,X77,X78,X81] :
( ( number_of_in(sequential_pairs,X76) = number_of_in(triangles,X76)
| ~ path(X77,X78,X76)
| ~ triangle(esk7_1(X76),esk8_1(X76),X81) )
& ( number_of_in(sequential_pairs,X76) = number_of_in(triangles,X76)
| ~ path(X77,X78,X76)
| sequential(esk7_1(X76),esk8_1(X76)) )
& ( number_of_in(sequential_pairs,X76) = number_of_in(triangles,X76)
| ~ path(X77,X78,X76)
| on_path(esk8_1(X76),X76) )
& ( number_of_in(sequential_pairs,X76) = number_of_in(triangles,X76)
| ~ path(X77,X78,X76)
| on_path(esk7_1(X76),X76) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[sequential_pairs_and_triangles])])])])])])]) ).
fof(c_0_4,negated_conjecture,
! [X93,X94] :
( number_of_in(sequential_pairs,esk10_0) != number_of_in(triangles,esk10_0)
& ( triangle(X93,X94,esk13_2(X93,X94))
| ~ sequential(X93,X94)
| ~ on_path(X94,esk10_0)
| ~ on_path(X93,esk10_0) )
& path(esk11_0,esk12_0,esk10_0)
& complete ),
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_5,plain,
( ~ path(X2,X3,X1)
| number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| on_path(esk8_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
path(esk11_0,esk12_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
number_of_in(sequential_pairs,esk10_0) != number_of_in(triangles,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( ~ sequential(X1,X2)
| ~ on_path(X2,esk10_0)
| ~ on_path(X1,esk10_0)
| triangle(X1,X2,esk13_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
on_path(esk8_1(esk10_0),esk10_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
cnf(c_0_10,plain,
( ~ path(X2,X3,X1)
| number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| on_path(esk7_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,plain,
( ~ path(X2,X3,X1)
| number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| sequential(esk7_1(X1),esk8_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
( ~ on_path(X1,esk10_0)
| ~ sequential(X1,esk8_1(esk10_0))
| triangle(X1,esk8_1(esk10_0),esk13_2(X1,esk8_1(esk10_0))) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
on_path(esk7_1(esk10_0),esk10_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_6]),c_0_7]) ).
cnf(c_0_14,negated_conjecture,
sequential(esk7_1(esk10_0),esk8_1(esk10_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_6]),c_0_7]) ).
cnf(c_0_15,plain,
( ~ path(X3,X4,X1)
| ~ triangle(esk7_1(X1),esk8_1(X1),X2)
| number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_16,negated_conjecture,
triangle(esk7_1(esk10_0),esk8_1(esk10_0),esk13_2(esk7_1(esk10_0),esk8_1(esk10_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_17,negated_conjecture,
~ path(X1,X2,esk10_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_7]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_6,c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRA010+2 : TPTP v9.3.1. Bugfixed v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n017.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 20 18:19:56 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/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.09/0.44 % Version: 3.5.1
% 0.09/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.44 % Starting sh5l with 300s (1) cores
% 0.09/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 371475 completed with status 0
% 0.09/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.09/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.44 % No SInE strategy applied
% 0.09/0.44 % Search class: FGHSF-FFMF32-SFFFFFNN
% 0.09/0.44 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.44 % Starting SubtermCWHack with 151s (1) cores
% 0.09/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 901s (1) cores
% 0.09/0.44 % Starting G-E--_107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y with 151s (1) cores
% 0.09/0.44 % Starting new_bool_3 with 151s (1) cores
% 0.09/0.44 % Starting new_bool_1 with 146s (1) cores
% 0.09/0.44 % new_bool_3 with pid 371484 completed with status 0
% 0.09/0.44 % Result found by new_bool_3
% 0.09/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.44 % No SInE strategy applied
% 0.09/0.44 % Search class: FGHSF-FFMF32-SFFFFFNN
% 0.09/0.44 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.44 % Starting SubtermCWHack with 151s (1) cores
% 0.09/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 901s (1) cores
% 0.09/0.44 % Starting G-E--_107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y with 151s (1) cores
% 0.09/0.44 % Starting new_bool_3 with 151s (1) cores
% 0.09/0.44 % Preprocessing time : 0.001 s
% 0.09/0.44 % Presaturation interreduction done
% 0.09/0.44
% 0.09/0.44 % Proof found!
% 0.09/0.44 % SZS status Theorem
% 0.09/0.44 % SZS output start CNFRefutation
% See solution above
% 0.09/0.44 % Parsed axioms : 19
% 0.09/0.44 % Removed by relevancy pruning/SinE : 0
% 0.09/0.44 % Initial clauses : 64
% 0.09/0.44 % Removed in clause preprocessing : 1
% 0.09/0.44 % Initial clauses in saturation : 63
% 0.09/0.44 % Processed clauses : 151
% 0.09/0.44 % ...of these trivial : 0
% 0.09/0.44 % ...subsumed : 1
% 0.09/0.44 % ...remaining for further processing : 150
% 0.09/0.44 % Other redundant clauses eliminated : 7
% 0.09/0.44 % Clauses deleted for lack of memory : 0
% 0.09/0.44 % Backward-subsumed : 0
% 0.09/0.44 % Backward-rewritten : 12
% 0.09/0.44 % Generated clauses : 62
% 0.09/0.44 % ...of the previous two non-redundant : 54
% 0.09/0.44 % ...aggressively subsumed : 0
% 0.09/0.44 % Contextual simplify-reflections : 8
% 0.09/0.44 % Paramodulations : 57
% 0.09/0.44 % Factorizations : 0
% 0.09/0.44 % NegExts : 0
% 0.09/0.44 % Equation resolutions : 7
% 0.09/0.44 % Disequality decompositions : 0
% 0.09/0.44 % Total rewrite steps : 35
% 0.09/0.44 % ...of those cached : 19
% 0.09/0.44 % Propositional unsat checks : 0
% 0.09/0.44 % Propositional check models : 0
% 0.09/0.44 % Propositional check unsatisfiable : 0
% 0.09/0.44 % Propositional clauses : 0
% 0.09/0.44 % Propositional clauses after purity: 0
% 0.09/0.44 % Propositional unsat core size : 0
% 0.09/0.44 % Propositional preprocessing time : 0.000
% 0.09/0.44 % Propositional encoding time : 0.000
% 0.09/0.44 % Propositional solver time : 0.000
% 0.09/0.44 % Success case prop preproc time : 0.000
% 0.09/0.44 % Success case prop encoding time : 0.000
% 0.09/0.44 % Success case prop solver time : 0.000
% 0.09/0.44 % Current number of processed clauses : 70
% 0.09/0.44 % Positive orientable unit clauses : 21
% 0.09/0.44 % Positive unorientable unit clauses: 0
% 0.09/0.44 % Negative unit clauses : 6
% 0.09/0.44 % Non-unit-clauses : 43
% 0.09/0.44 % Current number of unprocessed clauses: 29
% 0.09/0.44 % ...number of literals in the above : 97
% 0.09/0.44 % Current number of archived formulas : 0
% 0.09/0.44 % Current number of archived clauses : 76
% 0.09/0.44 % Clause-clause subsumption calls (NU) : 730
% 0.09/0.44 % Rec. Clause-clause subsumption calls : 390
% 0.09/0.44 % Non-unit clause-clause subsumptions : 8
% 0.09/0.44 % Unit Clause-clause subsumption calls : 86
% 0.09/0.44 % Rewrite failures with RHS unbound : 0
% 0.09/0.44 % BW rewrite match attempts : 11
% 0.09/0.44 % BW rewrite match successes : 11
% 0.09/0.44 % Condensation attempts : 0
% 0.09/0.44 % Condensation successes : 0
% 0.09/0.44 % Termbank termtop insertions : 6454
% 0.09/0.44 % Search garbage collected termcells : 1326
% 0.09/0.44
% 0.09/0.44 % -------------------------------------------------
% 0.09/0.44 % User time : 0.010 s
% 0.09/0.44 % System time : 0.005 s
% 0.09/0.44 % Total time : 0.015 s
% 0.09/0.44 % Maximum resident set size: 3668 pages
% 0.09/0.44
% 0.09/0.44 % -------------------------------------------------
% 0.09/0.44 % User time : 0.038 s
% 0.09/0.44 % System time : 0.015 s
% 0.09/0.44 % Total time : 0.054 s
% 0.09/0.44 % Maximum resident set size: 4608 pages
% 0.09/0.44 % E exiting
%------------------------------------------------------------------------------