%------------------------------------------------------------------------------
% File : E---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 : n013.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:16 PM UTC 2026
% Result : Theorem 0.04s 0.42s
% Output : CNFRefutation 0.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 8 unt; 0 def)
% Number of atoms : 103 ( 11 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 125 ( 46 ~; 52 |; 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(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(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(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,
! [X3,X4] :
( ( ~ object(X3)
| exemplifies_property(none_greater,X3)
| ~ exemplifies_property(conceivable,X3)
| exemplifies_property(conceivable,esk1_1(X3)) )
& ( ~ object(X3)
| exemplifies_property(none_greater,X3)
| ~ exemplifies_property(conceivable,X3)
| exemplifies_relation(greater_than,esk1_1(X3),X3) )
& ( ~ object(X3)
| exemplifies_property(none_greater,X3)
| ~ exemplifies_property(conceivable,X3)
| object(esk1_1(X3)) )
& ( ~ object(X3)
| ~ exemplifies_property(none_greater,X3)
| ~ exemplifies_property(conceivable,X4)
| ~ exemplifies_relation(greater_than,X4,X3)
| ~ object(X4) )
& ( ~ object(X3)
| ~ exemplifies_property(none_greater,X3)
| exemplifies_property(conceivable,X3) ) ),
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])])])])])]) ).
fof(c_0_5,plain,
! [X6,X7] :
( X6 = X7
| exemplifies_relation(greater_than,X7,X6)
| exemplifies_relation(greater_than,X6,X7)
| ~ object(X7)
| ~ object(X6) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[connectedness_of_greater_than])])]) ).
fof(c_0_6,negated_conjecture,
! [X9] :
( ( ~ exemplifies_property(none_greater,X9)
| ~ object(X9)
| esk3_1(X9) != X9 )
& ( ~ exemplifies_property(none_greater,X9)
| ~ object(X9)
| exemplifies_property(none_greater,esk3_1(X9)) )
& ( ~ exemplifies_property(none_greater,X9)
| ~ object(X9)
| object(esk3_1(X9)) )
& exemplifies_property(none_greater,esk2_0)
& object(esk2_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_7,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_4]) ).
cnf(c_0_8,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_5]) ).
cnf(c_0_9,negated_conjecture,
( ~ exemplifies_property(none_greater,X1)
| ~ object(X1)
| exemplifies_property(none_greater,esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
exemplifies_property(none_greater,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
object(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( ~ exemplifies_property(none_greater,X1)
| ~ object(X1)
| object(esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( ~ object(X1)
| ~ object(X2)
| ~ exemplifies_property(conceivable,X1)
| ~ exemplifies_property(none_greater,X2)
| exemplifies_relation(greater_than,X2,X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_14,negated_conjecture,
exemplifies_property(none_greater,esk3_1(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_15,negated_conjecture,
object(esk3_1(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_10]),c_0_11])]) ).
cnf(c_0_16,plain,
( ~ object(X1)
| ~ exemplifies_property(none_greater,X1)
| exemplifies_property(conceivable,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,negated_conjecture,
( ~ object(X1)
| ~ exemplifies_property(conceivable,X1)
| exemplifies_relation(greater_than,esk3_1(esk2_0),X1)
| X1 = esk3_1(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_18,negated_conjecture,
exemplifies_property(conceivable,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_10]),c_0_11])]) ).
cnf(c_0_19,negated_conjecture,
( exemplifies_relation(greater_than,esk3_1(esk2_0),esk2_0)
| esk3_1(esk2_0) = esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_11])]) ).
cnf(c_0_20,negated_conjecture,
exemplifies_property(conceivable,esk3_1(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_14]),c_0_15])]) ).
cnf(c_0_21,negated_conjecture,
( ~ exemplifies_property(none_greater,X1)
| ~ object(X1)
| esk3_1(X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,negated_conjecture,
esk3_1(esk2_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_19]),c_0_10]),c_0_11]),c_0_15])]),c_0_20])]) ).
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_10]),c_0_11])]),
[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.04/0.36 % Computer : n013.cluster.edu
% 0.04/0.36 % Model : x86_64 x86_64
% 0.04/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.36 % Memory : 8046.5625MB
% 0.04/0.36 % OS : Linux 6.8.0-71-generic
% 0.04/0.36 % CPULimit : 300
% 0.04/0.36 % WCLimit : 300
% 0.04/0.36 % DateTime : Mon Sep 21 03:29:24 UTC 2026
% 0.04/0.36 % CPUTime :
% 0.04/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.40 Running first-order theorem proving
% 0.04/0.40 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.04/0.42 % Version: 3.5.1
% 0.04/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.04/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.04/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.04/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.04/0.42 % Starting sh5l with 300s (1) cores
% 0.04/0.42 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 4046537 completed with status 0
% 0.04/0.42 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.04/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.04/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.04/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.04/0.42 % No SInE strategy applied
% 0.04/0.42 % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.04/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.04/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.04/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.04/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.04/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.04/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.04/0.42 % new_bool_1 with pid 4046545 completed with status 0
% 0.04/0.42 % Result found by new_bool_1
% 0.04/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.04/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.04/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.04/0.42 % No SInE strategy applied
% 0.04/0.42 % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.04/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.04/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.04/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.04/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.04/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.04/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.04/0.42 % Preprocessing time : 0.001 s
% 0.04/0.42 % Presaturation interreduction done
% 0.04/0.42
% 0.04/0.42 % Proof found!
% 0.04/0.42 % SZS status Theorem
% 0.04/0.42 % SZS output start CNFRefutation
% See solution above
% 0.04/0.42 % Parsed axioms : 3
% 0.04/0.42 % Removed by relevancy pruning/SinE : 0
% 0.04/0.42 % Initial clauses : 11
% 0.04/0.42 % Removed in clause preprocessing : 0
% 0.04/0.42 % Initial clauses in saturation : 11
% 0.04/0.42 % Processed clauses : 41
% 0.04/0.42 % ...of these trivial : 0
% 0.04/0.42 % ...subsumed : 1
% 0.04/0.42 % ...remaining for further processing : 40
% 0.04/0.42 % Other redundant clauses eliminated : 0
% 0.04/0.42 % Clauses deleted for lack of memory : 0
% 0.04/0.42 % Backward-subsumed : 0
% 0.04/0.42 % Backward-rewritten : 5
% 0.04/0.42 % Generated clauses : 52
% 0.04/0.42 % ...of the previous two non-redundant : 32
% 0.04/0.42 % ...aggressively subsumed : 0
% 0.04/0.42 % Contextual simplify-reflections : 0
% 0.04/0.42 % Paramodulations : 50
% 0.04/0.42 % Factorizations : 2
% 0.04/0.42 % NegExts : 0
% 0.04/0.42 % Equation resolutions : 0
% 0.04/0.42 % Disequality decompositions : 0
% 0.04/0.42 % Total rewrite steps : 62
% 0.04/0.42 % ...of those cached : 50
% 0.04/0.42 % Propositional unsat checks : 0
% 0.04/0.42 % Propositional check models : 0
% 0.04/0.42 % Propositional check unsatisfiable : 0
% 0.04/0.42 % Propositional clauses : 0
% 0.04/0.42 % Propositional clauses after purity: 0
% 0.04/0.42 % Propositional unsat core size : 0
% 0.04/0.42 % Propositional preprocessing time : 0.000
% 0.04/0.42 % Propositional encoding time : 0.000
% 0.04/0.42 % Propositional solver time : 0.000
% 0.04/0.42 % Success case prop preproc time : 0.000
% 0.04/0.42 % Success case prop encoding time : 0.000
% 0.04/0.42 % Success case prop solver time : 0.000
% 0.04/0.42 % Current number of processed clauses : 24
% 0.04/0.42 % Positive orientable unit clauses : 13
% 0.04/0.42 % Positive unorientable unit clauses: 0
% 0.04/0.42 % Negative unit clauses : 0
% 0.04/0.42 % Non-unit-clauses : 11
% 0.04/0.42 % Current number of unprocessed clauses: 12
% 0.04/0.42 % ...number of literals in the above : 27
% 0.04/0.42 % Current number of archived formulas : 0
% 0.04/0.42 % Current number of archived clauses : 16
% 0.04/0.42 % Clause-clause subsumption calls (NU) : 37
% 0.04/0.42 % Rec. Clause-clause subsumption calls : 8
% 0.04/0.42 % Non-unit clause-clause subsumptions : 1
% 0.04/0.42 % Unit Clause-clause subsumption calls : 0
% 0.04/0.42 % Rewrite failures with RHS unbound : 0
% 0.04/0.42 % BW rewrite match attempts : 13
% 0.04/0.42 % BW rewrite match successes : 1
% 0.04/0.42 % Condensation attempts : 0
% 0.04/0.42 % Condensation successes : 0
% 0.04/0.42 % Termbank termtop insertions : 1849
% 0.04/0.42 % Search garbage collected termcells : 207
% 0.04/0.42
% 0.04/0.42 % -------------------------------------------------
% 0.04/0.42 % User time : 0.004 s
% 0.04/0.42 % System time : 0.001 s
% 0.04/0.42 % Total time : 0.005 s
% 0.04/0.42 % Maximum resident set size: 3632 pages
% 0.04/0.42
% 0.04/0.42 % -------------------------------------------------
% 0.04/0.42 % User time : 0.014 s
% 0.04/0.42 % System time : 0.011 s
% 0.04/0.42 % Total time : 0.025 s
% 0.04/0.42 % Maximum resident set size: 4608 pages
% 0.04/0.42 % E exiting
%------------------------------------------------------------------------------