%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : PHI012+1 : TPTP v9.3.1. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:58:24 PM UTC 2026
% Result : Theorem 0.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 5 unt; 0 def)
% Number of atoms : 110 ( 14 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 135 ( 49 ~; 59 |; 18 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 26 ( 0 sgn 10 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(lemma_2,conjecture,
( ? [X1] :
( exemplifies_property(none_greater,X1)
& object(X1) )
=> ? [X1] :
( ! [X2] :
( object(X2)
=> ( exemplifies_property(none_greater,X2)
=> X2 = X1 ) )
& exemplifies_property(none_greater,X1)
& object(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_2) ).
fof(connectedness_of_greater_than,axiom,
! [X1,X2] :
( ( object(X2)
& object(X1) )
=> ( X1 = X2
| exemplifies_relation(greater_than,X2,X1)
| exemplifies_relation(greater_than,X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',connectedness_of_greater_than) ).
fof(definition_none_greater,axiom,
! [X1] :
( object(X1)
=> ( exemplifies_property(none_greater,X1)
<=> ( ~ ? [X2] :
( exemplifies_property(conceivable,X2)
& exemplifies_relation(greater_than,X2,X1)
& object(X2) )
& exemplifies_property(conceivable,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_none_greater) ).
fof(c_0_3,negated_conjecture,
~ ( ? [X1] :
( exemplifies_property(none_greater,X1)
& object(X1) )
=> ? [X1] :
( ! [X2] :
( object(X2)
=> ( exemplifies_property(none_greater,X2)
=> X2 = X1 ) )
& exemplifies_property(none_greater,X1)
& object(X1) ) ),
inference(assume_negation,[status(cth)],[lemma_2]) ).
fof(c_0_4,plain,
! [X9,X10] :
( X9 = X10
| exemplifies_relation(greater_than,X10,X9)
| exemplifies_relation(greater_than,X9,X10)
| ~ object(X10)
| ~ object(X9) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[connectedness_of_greater_than])])]) ).
fof(c_0_5,negated_conjecture,
! [X4] :
( ( ~ exemplifies_property(none_greater,X4)
| ~ object(X4)
| esk2_1(X4) != X4 )
& ( ~ exemplifies_property(none_greater,X4)
| ~ object(X4)
| exemplifies_property(none_greater,esk2_1(X4)) )
& ( ~ exemplifies_property(none_greater,X4)
| ~ object(X4)
| object(esk2_1(X4)) )
& exemplifies_property(none_greater,esk1_0)
& object(esk1_0) ),
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_6,plain,
( ~ object(X2)
| ~ object(X1)
| X1 = X2
| exemplifies_relation(greater_than,X2,X1)
| exemplifies_relation(greater_than,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( ~ exemplifies_property(none_greater,X1)
| ~ object(X1)
| object(esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( ~ object(X2)
| ~ object(X1)
| ~ exemplifies_property(none_greater,X2)
| exemplifies_relation(greater_than,X1,esk2_1(X2))
| exemplifies_relation(greater_than,esk2_1(X2),X1)
| X1 = esk2_1(X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
exemplifies_property(none_greater,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
object(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_11,plain,
! [X6,X7] :
( ( ~ object(X6)
| exemplifies_property(none_greater,X6)
| ~ exemplifies_property(conceivable,X6)
| exemplifies_property(conceivable,esk3_1(X6)) )
& ( ~ object(X6)
| exemplifies_property(none_greater,X6)
| ~ exemplifies_property(conceivable,X6)
| exemplifies_relation(greater_than,esk3_1(X6),X6) )
& ( ~ object(X6)
| exemplifies_property(none_greater,X6)
| ~ exemplifies_property(conceivable,X6)
| object(esk3_1(X6)) )
& ( ~ object(X6)
| ~ exemplifies_property(none_greater,X6)
| ~ exemplifies_property(conceivable,X7)
| ~ exemplifies_relation(greater_than,X7,X6)
| ~ object(X7) )
& ( ~ object(X6)
| ~ exemplifies_property(none_greater,X6)
| exemplifies_property(conceivable,X6) ) ),
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)],[definition_none_greater])])])])])]) ).
cnf(c_0_12,negated_conjecture,
( ~ object(X1)
| exemplifies_relation(greater_than,esk2_1(esk1_0),X1)
| exemplifies_relation(greater_than,X1,esk2_1(esk1_0))
| X1 = esk2_1(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_13,plain,
( ~ object(X2)
| ~ exemplifies_property(none_greater,X2)
| ~ exemplifies_property(conceivable,X1)
| ~ exemplifies_relation(greater_than,X1,X2)
| ~ object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
( exemplifies_relation(greater_than,esk1_0,esk2_1(esk1_0))
| exemplifies_relation(greater_than,esk2_1(esk1_0),esk1_0)
| esk2_1(esk1_0) = esk1_0 ),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_15,plain,
( ~ object(X1)
| ~ exemplifies_property(none_greater,X1)
| exemplifies_property(conceivable,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( ~ object(esk2_1(esk1_0))
| ~ exemplifies_property(conceivable,esk2_1(esk1_0))
| exemplifies_relation(greater_than,esk1_0,esk2_1(esk1_0))
| esk2_1(esk1_0) = esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_9]),c_0_10])]) ).
cnf(c_0_17,negated_conjecture,
exemplifies_property(conceivable,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_10]),c_0_9])]) ).
cnf(c_0_18,negated_conjecture,
( ~ object(esk2_1(esk1_0))
| ~ exemplifies_property(none_greater,esk2_1(esk1_0))
| esk2_1(esk1_0) = esk1_0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_16]),c_0_17]),c_0_10])]),c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( ~ exemplifies_property(none_greater,esk2_1(esk1_0))
| esk2_1(esk1_0) = esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_7]),c_0_9]),c_0_10])]) ).
cnf(c_0_20,negated_conjecture,
( ~ exemplifies_property(none_greater,X1)
| ~ object(X1)
| exemplifies_property(none_greater,esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,negated_conjecture,
( ~ exemplifies_property(none_greater,X1)
| ~ object(X1)
| esk2_1(X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_22,negated_conjecture,
esk2_1(esk1_0) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_9]),c_0_10])]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_9]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PHI012+1 : TPTP v9.3.1. Released v7.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n009.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 03:29:59 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 Running first-order theorem proving
% 0.15/0.43 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.15/0.45 % Version: 3.5.1
% 0.15/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 % Starting sh5l with 300s (1) cores
% 0.15/0.45 % sh5l with pid 747326 completed with status 0
% 0.15/0.45 % Result found by sh5l
% 0.15/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 % Starting sh5l with 300s (1) cores
% 0.15/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.45 % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.15/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.45 % SubtermCWHack with pid 747334 completed with status 0
% 0.15/0.45 % Result found by SubtermCWHack
% 0.15/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 % Starting sh5l with 300s (1) cores
% 0.15/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.45 % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.15/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.45 % Preprocessing time : 0.001 s
% 0.15/0.45
% 0.15/0.45 % Proof found!
% 0.15/0.45 % SZS status Theorem
% 0.15/0.45 % SZS output start CNFRefutation
% See solution above
% 0.15/0.45 % Parsed axioms : 3
% 0.15/0.45 % Removed by relevancy pruning/SinE : 0
% 0.15/0.45 % Initial clauses : 11
% 0.15/0.45 % Removed in clause preprocessing : 0
% 0.15/0.45 % Initial clauses in saturation : 11
% 0.15/0.45 % Processed clauses : 24
% 0.15/0.45 % ...of these trivial : 0
% 0.15/0.45 % ...subsumed : 1
% 0.15/0.45 % ...remaining for further processing : 23
% 0.15/0.45 % Other redundant clauses eliminated : 0
% 0.15/0.45 % Clauses deleted for lack of memory : 0
% 0.15/0.45 % Backward-subsumed : 1
% 0.15/0.45 % Backward-rewritten : 4
% 0.15/0.45 % Generated clauses : 26
% 0.15/0.45 % ...of the previous two non-redundant : 21
% 0.15/0.45 % ...aggressively subsumed : 0
% 0.15/0.45 % Contextual simplify-reflections : 2
% 0.15/0.45 % Paramodulations : 26
% 0.15/0.45 % Factorizations : 0
% 0.15/0.45 % NegExts : 0
% 0.15/0.45 % Equation resolutions : 0
% 0.15/0.45 % Disequality decompositions : 0
% 0.15/0.45 % Total rewrite steps : 31
% 0.15/0.45 % ...of those cached : 27
% 0.15/0.45 % Propositional unsat checks : 0
% 0.15/0.45 % Propositional check models : 0
% 0.15/0.45 % Propositional check unsatisfiable : 0
% 0.15/0.45 % Propositional clauses : 0
% 0.15/0.45 % Propositional clauses after purity: 0
% 0.15/0.45 % Propositional unsat core size : 0
% 0.15/0.45 % Propositional preprocessing time : 0.000
% 0.15/0.45 % Propositional encoding time : 0.000
% 0.15/0.45 % Propositional solver time : 0.000
% 0.15/0.45 % Success case prop preproc time : 0.000
% 0.15/0.45 % Success case prop encoding time : 0.000
% 0.15/0.45 % Success case prop solver time : 0.000
% 0.15/0.45 % Current number of processed clauses : 18
% 0.15/0.45 % Positive orientable unit clauses : 4
% 0.15/0.45 % Positive unorientable unit clauses: 0
% 0.15/0.45 % Negative unit clauses : 0
% 0.15/0.45 % Non-unit-clauses : 14
% 0.15/0.45 % Current number of unprocessed clauses: 7
% 0.15/0.45 % ...number of literals in the above : 47
% 0.15/0.45 % Current number of archived formulas : 0
% 0.15/0.45 % Current number of archived clauses : 5
% 0.15/0.45 % Clause-clause subsumption calls (NU) : 55
% 0.15/0.45 % Rec. Clause-clause subsumption calls : 19
% 0.15/0.45 % Non-unit clause-clause subsumptions : 4
% 0.15/0.45 % Unit Clause-clause subsumption calls : 1
% 0.15/0.45 % Rewrite failures with RHS unbound : 0
% 0.15/0.45 % BW rewrite match attempts : 1
% 0.15/0.45 % BW rewrite match successes : 1
% 0.15/0.45 % Condensation attempts : 0
% 0.15/0.45 % Condensation successes : 0
% 0.15/0.45 % Termbank termtop insertions : 1481
% 0.15/0.45 % Search garbage collected termcells : 211
% 0.15/0.45
% 0.15/0.45 % -------------------------------------------------
% 0.15/0.45 % User time : 0.006 s
% 0.15/0.45 % System time : 0.001 s
% 0.15/0.45 % Total time : 0.007 s
% 0.15/0.45 % Maximum resident set size: 3632 pages
% 0.15/0.45
% 0.15/0.45 % -------------------------------------------------
% 0.15/0.45 % User time : 0.009 s
% 0.15/0.45 % System time : 0.005 s
% 0.15/0.45 % Total time : 0.014 s
% 0.15/0.45 % Maximum resident set size: 4608 pages
% 0.15/0.45 % E exiting
%------------------------------------------------------------------------------