%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PHI014+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:17 PM UTC 2026
% Result : Theorem 0.12s 0.45s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 9 unt; 0 def)
% Number of atoms : 122 ( 0 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 150 ( 59 ~; 62 |; 18 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 39 ( 4 sgn 15 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(premise_2,axiom,
! [X4] :
( object(X4)
=> ( ( ~ exemplifies_property(existence,X4)
& is_the(X4,none_greater) )
=> ? [X2] :
( exemplifies_property(conceivable,X2)
& exemplifies_relation(greater_than,X2,X4)
& object(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_2) ).
fof(description_theorem_2,axiom,
! [X1] :
( property(X1)
=> ( ? [X2] :
( is_the(X2,X1)
& object(X2) )
=> ! [X3] :
( object(X3)
=> ( is_the(X3,X1)
=> exemplifies_property(X1,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',description_theorem_2) ).
fof(description_is_property_and_described_is_object,axiom,
! [X4,X1] :
( is_the(X4,X1)
=> ( object(X4)
& property(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',description_is_property_and_described_is_object) ).
fof(god_exists,conjecture,
exemplifies_property(existence,god),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',god_exists) ).
fof(definition_none_greater,axiom,
! [X4] :
( object(X4)
=> ( exemplifies_property(none_greater,X4)
<=> ( ~ ? [X2] :
( exemplifies_property(conceivable,X2)
& exemplifies_relation(greater_than,X2,X4)
& object(X2) )
& exemplifies_property(conceivable,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_none_greater) ).
fof(definition_god,axiom,
is_the(god,none_greater),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_god) ).
fof(c_0_6,plain,
! [X4] :
( object(X4)
=> ( ( ~ exemplifies_property(existence,X4)
& is_the(X4,none_greater) )
=> ? [X2] :
( exemplifies_property(conceivable,X2)
& exemplifies_relation(greater_than,X2,X4)
& object(X2) ) ) ),
inference(fof_simplification,[status(thm)],[premise_2]) ).
fof(c_0_7,plain,
! [X5,X6,X7] :
( exemplifies_property(X5,X7)
| ~ is_the(X7,X5)
| ~ object(X7)
| ~ is_the(X6,X5)
| ~ object(X6)
| ~ property(X5) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[description_theorem_2])])])]) ).
fof(c_0_8,plain,
! [X8,X9] :
( ( ~ is_the(X8,X9)
| object(X8) )
& ( ~ is_the(X8,X9)
| property(X9) ) ),
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_9,plain,
! [X13] :
( ( ~ object(X13)
| exemplifies_property(existence,X13)
| ~ is_the(X13,none_greater)
| exemplifies_property(conceivable,esk2_1(X13)) )
& ( ~ object(X13)
| exemplifies_property(existence,X13)
| ~ is_the(X13,none_greater)
| exemplifies_relation(greater_than,esk2_1(X13),X13) )
& ( ~ object(X13)
| exemplifies_property(existence,X13)
| ~ is_the(X13,none_greater)
| object(esk2_1(X13)) ) ),
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_6])])])])]) ).
cnf(c_0_10,plain,
( ~ is_the(X3,X1)
| ~ object(X3)
| ~ is_the(X2,X1)
| ~ object(X2)
| ~ property(X1)
| exemplifies_property(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ is_the(X2,X1)
| property(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( ~ is_the(X1,X2)
| object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,negated_conjecture,
~ exemplifies_property(existence,god),
inference(assume_negation,[status(cth)],[god_exists]) ).
fof(c_0_14,plain,
! [X10,X11] :
( ( ~ object(X10)
| exemplifies_property(none_greater,X10)
| ~ exemplifies_property(conceivable,X10)
| exemplifies_property(conceivable,esk1_1(X10)) )
& ( ~ object(X10)
| exemplifies_property(none_greater,X10)
| ~ exemplifies_property(conceivable,X10)
| exemplifies_relation(greater_than,esk1_1(X10),X10) )
& ( ~ object(X10)
| exemplifies_property(none_greater,X10)
| ~ exemplifies_property(conceivable,X10)
| object(esk1_1(X10)) )
& ( ~ object(X10)
| ~ exemplifies_property(none_greater,X10)
| ~ exemplifies_property(conceivable,X11)
| ~ exemplifies_relation(greater_than,X11,X10)
| ~ object(X11) )
& ( ~ object(X10)
| ~ exemplifies_property(none_greater,X10)
| exemplifies_property(conceivable,X10) ) ),
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_15,plain,
( ~ object(X1)
| ~ is_the(X1,none_greater)
| exemplifies_property(existence,X1)
| exemplifies_relation(greater_than,esk2_1(X1),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)
| object(esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
( ~ object(X1)
| ~ is_the(X1,none_greater)
| exemplifies_property(existence,X1)
| exemplifies_property(conceivable,esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,plain,
( ~ is_the(X3,X1)
| ~ is_the(X2,X1)
| exemplifies_property(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_12]) ).
cnf(c_0_19,plain,
is_the(god,none_greater),
inference(split_conjunct,[status(thm)],[definition_god]) ).
fof(c_0_20,negated_conjecture,
~ exemplifies_property(existence,god),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
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_14]) ).
cnf(c_0_22,plain,
( ~ is_the(X1,none_greater)
| exemplifies_property(existence,X1)
| exemplifies_relation(greater_than,esk2_1(X1),X1) ),
inference(csr,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_23,plain,
( ~ is_the(X1,none_greater)
| object(esk2_1(X1))
| exemplifies_property(existence,X1) ),
inference(csr,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_24,plain,
( ~ is_the(X1,none_greater)
| exemplifies_property(existence,X1)
| exemplifies_property(conceivable,esk2_1(X1)) ),
inference(csr,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_25,plain,
( ~ is_the(X1,none_greater)
| exemplifies_property(none_greater,god) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_26,negated_conjecture,
~ exemplifies_property(existence,god),
inference(fof_nnf,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( ~ is_the(X1,none_greater)
| ~ exemplifies_property(none_greater,X1)
| exemplifies_property(existence,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_12]),c_0_23]),c_0_24]) ).
cnf(c_0_28,plain,
exemplifies_property(none_greater,god),
inference(spm,[status(thm)],[c_0_25,c_0_19]) ).
cnf(c_0_29,negated_conjecture,
~ exemplifies_property(existence,god),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_19]),c_0_28])]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PHI014+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.12/0.38 % Computer : n009.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 03:30:14 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/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.12/0.45 % Version: 3.5.1
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45 % Starting sh5l with 300s (1) cores
% 0.12/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 748219 completed with status 0
% 0.12/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.45 % No SInE strategy applied
% 0.12/0.45 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.12/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.12/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.12/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.12/0.45 % SubtermCWHack with pid 748225 completed with status 0
% 0.12/0.45 % Result found by SubtermCWHack
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.45 % No SInE strategy applied
% 0.12/0.45 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.12/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.45 % Preprocessing time : 0.001 s
% 0.12/0.45
% 0.12/0.45 % Proof found!
% 0.12/0.45 % SZS status Theorem
% 0.12/0.45 % SZS output start CNFRefutation
% See solution above
% 0.12/0.45 % Parsed axioms : 6
% 0.12/0.45 % Removed by relevancy pruning/SinE : 0
% 0.12/0.45 % Initial clauses : 13
% 0.12/0.45 % Removed in clause preprocessing : 0
% 0.12/0.45 % Initial clauses in saturation : 13
% 0.12/0.45 % Processed clauses : 22
% 0.12/0.45 % ...of these trivial : 0
% 0.12/0.45 % ...subsumed : 2
% 0.12/0.45 % ...remaining for further processing : 20
% 0.12/0.45 % Other redundant clauses eliminated : 0
% 0.12/0.45 % Clauses deleted for lack of memory : 0
% 0.12/0.45 % Backward-subsumed : 0
% 0.12/0.45 % Backward-rewritten : 2
% 0.12/0.45 % Generated clauses : 10
% 0.12/0.45 % ...of the previous two non-redundant : 9
% 0.12/0.45 % ...aggressively subsumed : 0
% 0.12/0.45 % Contextual simplify-reflections : 9
% 0.12/0.45 % Paramodulations : 10
% 0.12/0.45 % Factorizations : 0
% 0.12/0.45 % NegExts : 0
% 0.12/0.45 % Equation resolutions : 0
% 0.12/0.45 % Disequality decompositions : 0
% 0.12/0.45 % Total rewrite steps : 3
% 0.12/0.45 % ...of those cached : 2
% 0.12/0.45 % Propositional unsat checks : 0
% 0.12/0.45 % Propositional check models : 0
% 0.12/0.45 % Propositional check unsatisfiable : 0
% 0.12/0.45 % Propositional clauses : 0
% 0.12/0.45 % Propositional clauses after purity: 0
% 0.12/0.45 % Propositional unsat core size : 0
% 0.12/0.45 % Propositional preprocessing time : 0.000
% 0.12/0.45 % Propositional encoding time : 0.000
% 0.12/0.45 % Propositional solver time : 0.000
% 0.12/0.45 % Success case prop preproc time : 0.000
% 0.12/0.45 % Success case prop encoding time : 0.000
% 0.12/0.45 % Success case prop solver time : 0.000
% 0.12/0.45 % Current number of processed clauses : 18
% 0.12/0.45 % Positive orientable unit clauses : 5
% 0.12/0.45 % Positive unorientable unit clauses: 0
% 0.12/0.45 % Negative unit clauses : 1
% 0.12/0.45 % Non-unit-clauses : 12
% 0.12/0.45 % Current number of unprocessed clauses: 0
% 0.12/0.45 % ...number of literals in the above : 0
% 0.12/0.45 % Current number of archived formulas : 0
% 0.12/0.45 % Current number of archived clauses : 2
% 0.12/0.45 % Clause-clause subsumption calls (NU) : 48
% 0.12/0.45 % Rec. Clause-clause subsumption calls : 37
% 0.12/0.45 % Non-unit clause-clause subsumptions : 11
% 0.12/0.45 % Unit Clause-clause subsumption calls : 7
% 0.12/0.45 % Rewrite failures with RHS unbound : 0
% 0.12/0.45 % BW rewrite match attempts : 1
% 0.12/0.45 % BW rewrite match successes : 1
% 0.12/0.45 % Condensation attempts : 0
% 0.12/0.45 % Condensation successes : 0
% 0.12/0.45 % Termbank termtop insertions : 1172
% 0.12/0.45 % Search garbage collected termcells : 212
% 0.12/0.45
% 0.12/0.45 % -------------------------------------------------
% 0.12/0.45 % User time : 0.005 s
% 0.12/0.45 % System time : 0.002 s
% 0.12/0.45 % Total time : 0.007 s
% 0.12/0.45 % Maximum resident set size: 3584 pages
% 0.12/0.45
% 0.12/0.45 % -------------------------------------------------
% 0.12/0.45 % User time : 0.013 s
% 0.12/0.45 % System time : 0.010 s
% 0.12/0.45 % Total time : 0.022 s
% 0.12/0.45 % Maximum resident set size: 4864 pages
% 0.12/0.45 % E exiting
%------------------------------------------------------------------------------