%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PHI015+1 : TPTP v9.3.1. Released v7.2.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:58:17 PM UTC 2026
% Result : Theorem 0.14s 5.45s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 35 ( 9 unt; 0 def)
% Number of atoms : 207 ( 24 equ)
% Maximal formula atoms : 74 ( 5 avg)
% Number of connectives : 295 ( 123 ~; 126 |; 34 &)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-4 aty)
% Number of variables : 54 ( 3 sgn 23 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(premise_2,axiom,
! [X1] :
( object(X1)
=> ( ( ~ exemplifies_property(existence,X1)
& is_the(X1,none_greater) )
=> ? [X4] :
( exemplifies_property(conceivable,X4)
& exemplifies_relation(greater_than,X4,X1)
& object(X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_2) ).
fof(definition_none_greater,axiom,
! [X1] :
( object(X1)
=> ( exemplifies_property(none_greater,X1)
<=> ( ~ ? [X4] :
( exemplifies_property(conceivable,X4)
& exemplifies_relation(greater_than,X4,X1)
& object(X4) )
& exemplifies_property(conceivable,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_none_greater) ).
fof(exemplifier_is_object_and_exemplified_is_property,axiom,
! [X1,X2] :
( exemplifies_property(X2,X1)
=> ( object(X1)
& property(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',exemplifier_is_object_and_exemplified_is_property) ).
fof(description_is_property_and_described_is_object,axiom,
! [X1,X2] :
( is_the(X1,X2)
=> ( object(X1)
& property(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_is_property_and_described_is_object) ).
fof(god_exists,conjecture,
exemplifies_property(existence,god),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',god_exists) ).
fof(description_axiom_identity_instance,axiom,
! [X2,X1,X6] :
( ( object(X6)
& object(X1)
& property(X2) )
=> ( ( X1 = X6
& is_the(X1,X2) )
<=> ? [X4] :
( X4 = X6
& ! [X5] :
( object(X5)
=> ( exemplifies_property(X2,X5)
=> X5 = X4 ) )
& exemplifies_property(X2,X4)
& object(X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_axiom_identity_instance) ).
fof(definition_god,axiom,
is_the(god,none_greater),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_god) ).
fof(c_0_7,plain,
! [X1] :
( object(X1)
=> ( ( ~ exemplifies_property(existence,X1)
& is_the(X1,none_greater) )
=> ? [X4] :
( exemplifies_property(conceivable,X4)
& exemplifies_relation(greater_than,X4,X1)
& object(X4) ) ) ),
inference(fof_simplification,[status(thm)],[premise_2]) ).
fof(c_0_8,plain,
! [X29,X30] :
( ( ~ object(X29)
| exemplifies_property(none_greater,X29)
| ~ exemplifies_property(conceivable,X29)
| exemplifies_property(conceivable,esk7_1(X29)) )
& ( ~ object(X29)
| exemplifies_property(none_greater,X29)
| ~ exemplifies_property(conceivable,X29)
| exemplifies_relation(greater_than,esk7_1(X29),X29) )
& ( ~ object(X29)
| exemplifies_property(none_greater,X29)
| ~ exemplifies_property(conceivable,X29)
| object(esk7_1(X29)) )
& ( ~ object(X29)
| ~ exemplifies_property(none_greater,X29)
| ~ exemplifies_property(conceivable,X30)
| ~ exemplifies_relation(greater_than,X30,X29)
| ~ object(X30) )
& ( ~ object(X29)
| ~ exemplifies_property(none_greater,X29)
| exemplifies_property(conceivable,X29) ) ),
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_9,plain,
! [X7,X8] :
( ( ~ exemplifies_property(X8,X7)
| object(X7) )
& ( ~ exemplifies_property(X8,X7)
| property(X8) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[exemplifier_is_object_and_exemplified_is_property])])])]) ).
fof(c_0_10,plain,
! [X23] :
( ( ~ object(X23)
| exemplifies_property(existence,X23)
| ~ is_the(X23,none_greater)
| exemplifies_property(conceivable,esk5_1(X23)) )
& ( ~ object(X23)
| exemplifies_property(existence,X23)
| ~ is_the(X23,none_greater)
| exemplifies_relation(greater_than,esk5_1(X23),X23) )
& ( ~ object(X23)
| exemplifies_property(existence,X23)
| ~ is_the(X23,none_greater)
| object(esk5_1(X23)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])]) ).
fof(c_0_11,plain,
! [X26,X27] :
( ( ~ is_the(X26,X27)
| object(X26) )
& ( ~ is_the(X26,X27)
| property(X27) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[description_is_property_and_described_is_object])])])]) ).
fof(c_0_12,negated_conjecture,
~ exemplifies_property(existence,god),
inference(assume_negation,[status(cth)],[god_exists]) ).
fof(c_0_13,plain,
! [X16,X17,X18,X20,X21] :
( ( ~ object(X18)
| ~ object(X17)
| ~ property(X16)
| X21 != X18
| ~ exemplifies_property(X16,X21)
| ~ object(X21)
| esk4_4(X16,X17,X18,X21) != X21
| X17 = X18 )
& ( ~ object(X18)
| ~ object(X17)
| ~ property(X16)
| X21 != X18
| ~ exemplifies_property(X16,X21)
| ~ object(X21)
| esk4_4(X16,X17,X18,X21) != X21
| is_the(X17,X16) )
& ( ~ object(X18)
| ~ object(X17)
| ~ property(X16)
| X21 != X18
| ~ exemplifies_property(X16,X21)
| ~ object(X21)
| exemplifies_property(X16,esk4_4(X16,X17,X18,X21))
| X17 = X18 )
& ( ~ object(X18)
| ~ object(X17)
| ~ property(X16)
| X21 != X18
| ~ exemplifies_property(X16,X21)
| ~ object(X21)
| exemplifies_property(X16,esk4_4(X16,X17,X18,X21))
| is_the(X17,X16) )
& ( ~ object(X18)
| ~ object(X17)
| ~ property(X16)
| X21 != X18
| ~ exemplifies_property(X16,X21)
| ~ object(X21)
| object(esk4_4(X16,X17,X18,X21))
| X17 = X18 )
& ( ~ object(X18)
| ~ object(X17)
| ~ property(X16)
| X21 != X18
| ~ exemplifies_property(X16,X21)
| ~ object(X21)
| object(esk4_4(X16,X17,X18,X21))
| is_the(X17,X16) )
& ( ~ object(X18)
| ~ object(X17)
| ~ property(X16)
| X17 != X18
| ~ is_the(X17,X16)
| esk3_3(X16,X17,X18) = X18 )
& ( ~ object(X18)
| ~ object(X17)
| ~ property(X16)
| X17 != X18
| ~ is_the(X17,X16)
| X20 = esk3_3(X16,X17,X18)
| ~ exemplifies_property(X16,X20)
| ~ object(X20) )
& ( ~ object(X18)
| ~ object(X17)
| ~ property(X16)
| X17 != X18
| ~ is_the(X17,X16)
| exemplifies_property(X16,esk3_3(X16,X17,X18)) )
& ( ~ object(X18)
| ~ object(X17)
| ~ property(X16)
| X17 != X18
| ~ is_the(X17,X16)
| object(esk3_3(X16,X17,X18)) ) ),
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)],[description_axiom_identity_instance])])])])])]) ).
cnf(c_0_14,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_8]) ).
cnf(c_0_15,plain,
( ~ exemplifies_property(X2,X1)
| object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( ~ object(X1)
| ~ is_the(X1,none_greater)
| exemplifies_property(existence,X1)
| exemplifies_relation(greater_than,esk5_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( ~ is_the(X1,X2)
| object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( ~ object(X1)
| ~ is_the(X1,none_greater)
| exemplifies_property(existence,X1)
| exemplifies_property(conceivable,esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_19,negated_conjecture,
~ exemplifies_property(existence,god),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( ~ object(X3)
| ~ object(X2)
| ~ property(X1)
| X2 != X3
| ~ is_the(X2,X1)
| exemplifies_property(X1,esk3_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( ~ is_the(X2,X1)
| property(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,plain,
( ~ object(X3)
| ~ object(X2)
| ~ property(X1)
| X2 != X3
| ~ is_the(X2,X1)
| esk3_3(X1,X2,X3) = X3 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,plain,
( ~ exemplifies_property(conceivable,X1)
| ~ exemplifies_property(none_greater,X2)
| ~ exemplifies_relation(greater_than,X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_14,c_0_15]),c_0_15]) ).
cnf(c_0_24,plain,
( ~ is_the(X1,none_greater)
| exemplifies_property(existence,X1)
| exemplifies_relation(greater_than,esk5_1(X1),X1) ),
inference(csr,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_25,plain,
( ~ is_the(X1,none_greater)
| exemplifies_property(existence,X1)
| exemplifies_property(conceivable,esk5_1(X1)) ),
inference(csr,[status(thm)],[c_0_18,c_0_17]) ).
fof(c_0_26,negated_conjecture,
~ exemplifies_property(existence,god),
inference(fof_nnf,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
( ~ is_the(X2,X1)
| exemplifies_property(X1,esk3_3(X1,X2,X2)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_20,c_0_17]),c_0_21])]),c_0_17]) ).
cnf(c_0_28,plain,
( ~ is_the(X2,X1)
| esk3_3(X1,X2,X2) = X2 ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_22,c_0_17]),c_0_21])]),c_0_17]) ).
cnf(c_0_29,plain,
( ~ exemplifies_property(none_greater,X1)
| ~ is_the(X1,none_greater)
| exemplifies_property(existence,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_30,plain,
is_the(god,none_greater),
inference(split_conjunct,[status(thm)],[definition_god]) ).
cnf(c_0_31,negated_conjecture,
~ exemplifies_property(existence,god),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,plain,
( ~ is_the(X2,X1)
| exemplifies_property(X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
~ exemplifies_property(none_greater,god),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_34,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_30]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PHI015+1 : TPTP v9.3.1. Released v7.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/5.38 % Computer : n003.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Mon Sep 21 03:32:06 UTC 2026
% 0.11/5.38 % CPUTime :
% 0.11/5.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/5.42 Running first-order theorem proving
% 0.14/5.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.14/5.45 % Version: 3.5.1
% 0.14/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/5.45 % Starting sh5l with 300s (1) cores
% 0.14/5.45 % new_bool_1 with pid 3313890 completed with status 0
% 0.14/5.45 % Result found by new_bool_1
% 0.14/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/5.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/5.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/5.45 % Search class: FGHSF-FFMS32-SFFFFFNN
% 0.14/5.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.45 % Starting SubtermCWHack with 31s (1) cores
% 0.14/5.45 % SubtermCWHack with pid 3313892 completed with status 0
% 0.14/5.45 % Result found by SubtermCWHack
% 0.14/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/5.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/5.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/5.45 % Search class: FGHSF-FFMS32-SFFFFFNN
% 0.14/5.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.45 % Starting SubtermCWHack with 31s (1) cores
% 0.14/5.45 % Preprocessing time : 0.002 s
% 0.14/5.45
% 0.14/5.45 % Proof found!
% 0.14/5.45 % SZS status Theorem
% 0.14/5.45 % SZS output start CNFRefutation
% See solution above
% 0.14/5.45 % Parsed axioms : 11
% 0.14/5.45 % Removed by relevancy pruning/SinE : 0
% 0.14/5.45 % Initial clauses : 38
% 0.14/5.45 % Removed in clause preprocessing : 0
% 0.14/5.45 % Initial clauses in saturation : 38
% 0.14/5.45 % Processed clauses : 46
% 0.14/5.45 % ...of these trivial : 0
% 0.14/5.45 % ...subsumed : 7
% 0.14/5.45 % ...remaining for further processing : 39
% 0.14/5.45 % Other redundant clauses eliminated : 4
% 0.14/5.45 % Clauses deleted for lack of memory : 0
% 0.14/5.45 % Backward-subsumed : 0
% 0.14/5.45 % Backward-rewritten : 1
% 0.14/5.45 % Generated clauses : 43
% 0.14/5.45 % ...of the previous two non-redundant : 37
% 0.14/5.45 % ...aggressively subsumed : 0
% 0.14/5.45 % Contextual simplify-reflections : 25
% 0.14/5.45 % Paramodulations : 39
% 0.14/5.45 % Factorizations : 0
% 0.14/5.45 % NegExts : 0
% 0.14/5.45 % Equation resolutions : 4
% 0.14/5.45 % Disequality decompositions : 0
% 0.14/5.45 % Total rewrite steps : 6
% 0.14/5.45 % ...of those cached : 2
% 0.14/5.45 % Propositional unsat checks : 0
% 0.14/5.45 % Propositional check models : 0
% 0.14/5.45 % Propositional check unsatisfiable : 0
% 0.14/5.45 % Propositional clauses : 0
% 0.14/5.45 % Propositional clauses after purity: 0
% 0.14/5.45 % Propositional unsat core size : 0
% 0.14/5.45 % Propositional preprocessing time : 0.000
% 0.14/5.45 % Propositional encoding time : 0.000
% 0.14/5.45 % Propositional solver time : 0.000
% 0.14/5.45 % Success case prop preproc time : 0.000
% 0.14/5.45 % Success case prop encoding time : 0.000
% 0.14/5.45 % Success case prop solver time : 0.000
% 0.14/5.45 % Current number of processed clauses : 34
% 0.14/5.45 % Positive orientable unit clauses : 6
% 0.14/5.45 % Positive unorientable unit clauses: 0
% 0.14/5.45 % Negative unit clauses : 4
% 0.14/5.45 % Non-unit-clauses : 24
% 0.14/5.45 % Current number of unprocessed clauses: 29
% 0.14/5.45 % ...number of literals in the above : 183
% 0.14/5.45 % Current number of archived formulas : 0
% 0.14/5.45 % Current number of archived clauses : 1
% 0.14/5.45 % Clause-clause subsumption calls (NU) : 219
% 0.14/5.45 % Rec. Clause-clause subsumption calls : 148
% 0.14/5.45 % Non-unit clause-clause subsumptions : 31
% 0.14/5.45 % Unit Clause-clause subsumption calls : 12
% 0.14/5.45 % Rewrite failures with RHS unbound : 0
% 0.14/5.45 % BW rewrite match attempts : 1
% 0.14/5.45 % BW rewrite match successes : 1
% 0.14/5.45 % Condensation attempts : 0
% 0.14/5.45 % Condensation successes : 0
% 0.14/5.45 % Termbank termtop insertions : 3220
% 0.14/5.45 % Search garbage collected termcells : 649
% 0.14/5.45
% 0.14/5.45 % -------------------------------------------------
% 0.14/5.45 % User time : 0.007 s
% 0.14/5.45 % System time : 0.001 s
% 0.14/5.45 % Total time : 0.008 s
% 0.14/5.45 % Maximum resident set size: 3644 pages
% 0.14/5.45
% 0.14/5.45 % -------------------------------------------------
% 0.14/5.45 % User time : 0.008 s
% 0.14/5.45 % System time : 0.007 s
% 0.14/5.45 % Total time : 0.014 s
% 0.14/5.45 % Maximum resident set size: 4864 pages
% 0.14/5.45 % E exiting
%------------------------------------------------------------------------------