%------------------------------------------------------------------------------
% File : E-SAT---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 : n008.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:25 PM UTC 2026
% Result : Theorem 0.23s 0.60s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 12 unt; 0 def)
% Number of atoms : 205 ( 25 equ)
% Maximal formula atoms : 74 ( 5 avg)
% Number of connectives : 289 ( 120 ~; 123 |; 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 : 51 ( 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(god_exists,conjecture,
exemplifies_property(existence,god),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',god_exists) ).
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(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_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(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,negated_conjecture,
~ exemplifies_property(existence,god),
inference(assume_negation,[status(cth)],[god_exists]) ).
fof(c_0_9,plain,
! [X32] :
( ( ~ object(X32)
| exemplifies_property(existence,X32)
| ~ is_the(X32,none_greater)
| exemplifies_property(conceivable,esk7_1(X32)) )
& ( ~ object(X32)
| exemplifies_property(existence,X32)
| ~ is_the(X32,none_greater)
| exemplifies_relation(greater_than,esk7_1(X32),X32) )
& ( ~ object(X32)
| exemplifies_property(existence,X32)
| ~ is_the(X32,none_greater)
| object(esk7_1(X32)) ) ),
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_10,plain,
! [X10,X11] :
( ( ~ is_the(X10,X11)
| object(X10) )
& ( ~ is_the(X10,X11)
| property(X11) ) ),
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_11,negated_conjecture,
~ exemplifies_property(existence,god),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X19,X20,X21,X23,X24] :
( ( ~ object(X21)
| ~ object(X20)
| ~ property(X19)
| X24 != X21
| ~ exemplifies_property(X19,X24)
| ~ object(X24)
| esk4_4(X19,X20,X21,X24) != X24
| X20 = X21 )
& ( ~ object(X21)
| ~ object(X20)
| ~ property(X19)
| X24 != X21
| ~ exemplifies_property(X19,X24)
| ~ object(X24)
| esk4_4(X19,X20,X21,X24) != X24
| is_the(X20,X19) )
& ( ~ object(X21)
| ~ object(X20)
| ~ property(X19)
| X24 != X21
| ~ exemplifies_property(X19,X24)
| ~ object(X24)
| exemplifies_property(X19,esk4_4(X19,X20,X21,X24))
| X20 = X21 )
& ( ~ object(X21)
| ~ object(X20)
| ~ property(X19)
| X24 != X21
| ~ exemplifies_property(X19,X24)
| ~ object(X24)
| exemplifies_property(X19,esk4_4(X19,X20,X21,X24))
| is_the(X20,X19) )
& ( ~ object(X21)
| ~ object(X20)
| ~ property(X19)
| X24 != X21
| ~ exemplifies_property(X19,X24)
| ~ object(X24)
| object(esk4_4(X19,X20,X21,X24))
| X20 = X21 )
& ( ~ object(X21)
| ~ object(X20)
| ~ property(X19)
| X24 != X21
| ~ exemplifies_property(X19,X24)
| ~ object(X24)
| object(esk4_4(X19,X20,X21,X24))
| is_the(X20,X19) )
& ( ~ object(X21)
| ~ object(X20)
| ~ property(X19)
| X20 != X21
| ~ is_the(X20,X19)
| esk3_3(X19,X20,X21) = X21 )
& ( ~ object(X21)
| ~ object(X20)
| ~ property(X19)
| X20 != X21
| ~ is_the(X20,X19)
| X23 = esk3_3(X19,X20,X21)
| ~ exemplifies_property(X19,X23)
| ~ object(X23) )
& ( ~ object(X21)
| ~ object(X20)
| ~ property(X19)
| X20 != X21
| ~ is_the(X20,X19)
| exemplifies_property(X19,esk3_3(X19,X20,X21)) )
& ( ~ object(X21)
| ~ object(X20)
| ~ property(X19)
| X20 != X21
| ~ is_the(X20,X19)
| object(esk3_3(X19,X20,X21)) ) ),
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])])])])])]) ).
fof(c_0_13,plain,
! [X28,X29] :
( ( ~ object(X28)
| exemplifies_property(none_greater,X28)
| ~ exemplifies_property(conceivable,X28)
| exemplifies_property(conceivable,esk5_1(X28)) )
& ( ~ object(X28)
| exemplifies_property(none_greater,X28)
| ~ exemplifies_property(conceivable,X28)
| exemplifies_relation(greater_than,esk5_1(X28),X28) )
& ( ~ object(X28)
| exemplifies_property(none_greater,X28)
| ~ exemplifies_property(conceivable,X28)
| object(esk5_1(X28)) )
& ( ~ object(X28)
| ~ exemplifies_property(none_greater,X28)
| ~ exemplifies_property(conceivable,X29)
| ~ exemplifies_relation(greater_than,X29,X28)
| ~ object(X29) )
& ( ~ object(X28)
| ~ exemplifies_property(none_greater,X28)
| exemplifies_property(conceivable,X28) ) ),
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_14,plain,
! [X8,X9] :
( ( ~ exemplifies_property(X9,X8)
| object(X8) )
& ( ~ exemplifies_property(X9,X8)
| property(X9) ) ),
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])])])]) ).
cnf(c_0_15,plain,
( ~ object(X1)
| ~ is_the(X1,none_greater)
| exemplifies_property(existence,X1)
| exemplifies_relation(greater_than,esk7_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( ~ is_the(X1,X2)
| object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_17,negated_conjecture,
~ exemplifies_property(existence,god),
inference(fof_nnf,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( ~ object(X1)
| ~ is_the(X1,none_greater)
| exemplifies_property(existence,X1)
| exemplifies_property(conceivable,esk7_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,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_12]) ).
cnf(c_0_20,plain,
( ~ is_the(X2,X1)
| property(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,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_13]) ).
cnf(c_0_22,plain,
( ~ exemplifies_property(X2,X1)
| object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
( ~ is_the(X1,none_greater)
| exemplifies_property(existence,X1)
| exemplifies_relation(greater_than,esk7_1(X1),X1) ),
inference(csr,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_24,plain,
is_the(god,none_greater),
inference(split_conjunct,[status(thm)],[definition_god]) ).
cnf(c_0_25,negated_conjecture,
~ exemplifies_property(existence,god),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
( ~ is_the(X1,none_greater)
| exemplifies_property(existence,X1)
| exemplifies_property(conceivable,esk7_1(X1)) ),
inference(csr,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_27,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_12]) ).
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_19,c_0_16]),c_0_20])]),c_0_16]) ).
cnf(c_0_29,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_21,c_0_22]),c_0_22]) ).
cnf(c_0_30,plain,
exemplifies_relation(greater_than,esk7_1(god),god),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_31,plain,
exemplifies_property(conceivable,esk7_1(god)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_24]),c_0_25]) ).
cnf(c_0_32,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_27,c_0_16]),c_0_20])]),c_0_16]) ).
cnf(c_0_33,plain,
esk3_3(none_greater,god,god) = god,
inference(spm,[status(thm)],[c_0_28,c_0_24]) ).
cnf(c_0_34,plain,
~ exemplifies_property(none_greater,god),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_35,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_24]),c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : PHI015+1 : TPTP v9.3.1. Released v7.2.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.46 % Computer : n008.cluster.edu
% 0.17/0.46 % Model : x86_64 x86_64
% 0.17/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.46 % Memory : 8046.5625MB
% 0.17/0.46 % OS : Linux 6.8.0-71-generic
% 0.17/0.46 % CPULimit : 300
% 0.17/0.46 % WCLimit : 300
% 0.17/0.46 % DateTime : Mon Sep 21 03:31:12 UTC 2026
% 0.17/0.46 % CPUTime :
% 0.17/0.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 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.23/0.60 % Version: 3.5.1
% 0.23/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.60 % Starting sh5l with 300s (1) cores
% 0.23/0.60 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 58508 completed with status 0
% 0.23/0.60 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.60 % No SInE strategy applied
% 0.23/0.60 % Search class: FGHSF-FFMS32-SFFFFFNN
% 0.23/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.60 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.23/0.60 % Starting new_bool_3 with 136s (1) cores
% 0.23/0.60 % Starting new_bool_1 with 136s (1) cores
% 0.23/0.60 % new_bool_1 with pid 58516 completed with status 0
% 0.23/0.60 % Result found by new_bool_1
% 0.23/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.60 % No SInE strategy applied
% 0.23/0.60 % Search class: FGHSF-FFMS32-SFFFFFNN
% 0.23/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.60 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.23/0.60 % Starting new_bool_3 with 136s (1) cores
% 0.23/0.60 % Starting new_bool_1 with 136s (1) cores
% 0.23/0.60 % Preprocessing time : 0.003 s
% 0.23/0.60 % Presaturation interreduction done
% 0.23/0.60
% 0.23/0.60 % Proof found!
% 0.23/0.60 % SZS status Theorem
% 0.23/0.60 % SZS output start CNFRefutation
% See solution above
% 0.23/0.60 % Parsed axioms : 11
% 0.23/0.60 % Removed by relevancy pruning/SinE : 0
% 0.23/0.60 % Initial clauses : 38
% 0.23/0.60 % Removed in clause preprocessing : 0
% 0.23/0.60 % Initial clauses in saturation : 38
% 0.23/0.60 % Processed clauses : 91
% 0.23/0.60 % ...of these trivial : 1
% 0.23/0.60 % ...subsumed : 2
% 0.23/0.60 % ...remaining for further processing : 88
% 0.23/0.60 % Other redundant clauses eliminated : 10
% 0.23/0.60 % Clauses deleted for lack of memory : 0
% 0.23/0.60 % Backward-subsumed : 0
% 0.23/0.60 % Backward-rewritten : 0
% 0.23/0.60 % Generated clauses : 45
% 0.23/0.60 % ...of the previous two non-redundant : 34
% 0.23/0.60 % ...aggressively subsumed : 0
% 0.23/0.60 % Contextual simplify-reflections : 73
% 0.23/0.60 % Paramodulations : 33
% 0.23/0.60 % Factorizations : 2
% 0.23/0.60 % NegExts : 0
% 0.23/0.60 % Equation resolutions : 10
% 0.23/0.60 % Disequality decompositions : 0
% 0.23/0.60 % Total rewrite steps : 14
% 0.23/0.60 % ...of those cached : 5
% 0.23/0.60 % Propositional unsat checks : 0
% 0.23/0.60 % Propositional check models : 0
% 0.23/0.60 % Propositional check unsatisfiable : 0
% 0.23/0.60 % Propositional clauses : 0
% 0.23/0.60 % Propositional clauses after purity: 0
% 0.23/0.60 % Propositional unsat core size : 0
% 0.23/0.60 % Propositional preprocessing time : 0.000
% 0.23/0.60 % Propositional encoding time : 0.000
% 0.23/0.60 % Propositional solver time : 0.000
% 0.23/0.60 % Success case prop preproc time : 0.000
% 0.23/0.60 % Success case prop encoding time : 0.000
% 0.23/0.60 % Success case prop solver time : 0.000
% 0.23/0.60 % Current number of processed clauses : 40
% 0.23/0.60 % Positive orientable unit clauses : 11
% 0.23/0.60 % Positive unorientable unit clauses: 0
% 0.23/0.60 % Negative unit clauses : 4
% 0.23/0.60 % Non-unit-clauses : 25
% 0.23/0.60 % Current number of unprocessed clauses: 19
% 0.23/0.60 % ...number of literals in the above : 76
% 0.23/0.60 % Current number of archived formulas : 0
% 0.23/0.60 % Current number of archived clauses : 38
% 0.23/0.60 % Clause-clause subsumption calls (NU) : 773
% 0.23/0.60 % Rec. Clause-clause subsumption calls : 379
% 0.23/0.60 % Non-unit clause-clause subsumptions : 75
% 0.23/0.60 % Unit Clause-clause subsumption calls : 29
% 0.23/0.60 % Rewrite failures with RHS unbound : 0
% 0.23/0.60 % BW rewrite match attempts : 0
% 0.23/0.60 % BW rewrite match successes : 0
% 0.23/0.60 % Condensation attempts : 0
% 0.23/0.60 % Condensation successes : 0
% 0.23/0.60 % Termbank termtop insertions : 3471
% 0.23/0.60 % Search garbage collected termcells : 649
% 0.23/0.60
% 0.23/0.60 % -------------------------------------------------
% 0.23/0.60 % User time : 0.020 s
% 0.23/0.60 % System time : 0.004 s
% 0.23/0.60 % Total time : 0.024 s
% 0.23/0.60 % Maximum resident set size: 3388 pages
% 0.23/0.60
% 0.23/0.60 % -------------------------------------------------
% 0.23/0.60 % User time : 0.037 s
% 0.23/0.60 % System time : 0.012 s
% 0.23/0.60 % Total time : 0.049 s
% 0.23/0.60 % Maximum resident set size: 4608 pages
% 0.23/0.60 % E exiting
%------------------------------------------------------------------------------