%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : PHI013+1 : TPTP v9.2.1. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 05:01:09 PM UTC 2026
% Result : Theorem 1.28s 1.72s
% Output : CNFRefutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 7 unt; 0 def)
% Number of atoms : 120 ( 0 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 149 ( 58 ~; 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 ( 3 sgn 15 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(premise_2,axiom,
! [X5] :
( object(X5)
=> ( ( is_the(X5,none_greater)
& ~ exemplifies_property(existence,X5) )
=> ? [X2] :
( object(X2)
& exemplifies_relation(greater_than,X2,X5)
& exemplifies_property(conceivable,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_2) ).
fof(description_is_property_and_described_is_object,axiom,
! [X5,X1] :
( is_the(X5,X1)
=> ( property(X1)
& object(X5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_is_property_and_described_is_object) ).
fof(definition_none_greater,axiom,
! [X5] :
( object(X5)
=> ( exemplifies_property(none_greater,X5)
<=> ( exemplifies_property(conceivable,X5)
& ~ ? [X2] :
( object(X2)
& exemplifies_relation(greater_than,X2,X5)
& exemplifies_property(conceivable,X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_none_greater) ).
fof(description_theorem_2,axiom,
! [X1] :
( property(X1)
=> ( ? [X2] :
( object(X2)
& is_the(X2,X1) )
=> ! [X3] :
( object(X3)
=> ( is_the(X3,X1)
=> exemplifies_property(X1,X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_theorem_2) ).
fof(god_exists,conjecture,
exemplifies_property(existence,god),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',god_exists) ).
fof(definition_god,axiom,
is_the(god,none_greater),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_god) ).
fof(c_0_6,plain,
! [X5] :
( object(X5)
=> ( ( is_the(X5,none_greater)
& ~ exemplifies_property(existence,X5) )
=> ? [X2] :
( object(X2)
& exemplifies_relation(greater_than,X2,X5)
& exemplifies_property(conceivable,X2) ) ) ),
inference(fof_simplification,[status(thm)],[premise_2]) ).
fof(c_0_7,plain,
! [X39] :
( ( object(esk6_1(X39))
| ~ is_the(X39,none_greater)
| exemplifies_property(existence,X39)
| ~ object(X39) )
& ( exemplifies_relation(greater_than,esk6_1(X39),X39)
| ~ is_the(X39,none_greater)
| exemplifies_property(existence,X39)
| ~ object(X39) )
& ( exemplifies_property(conceivable,esk6_1(X39))
| ~ is_the(X39,none_greater)
| exemplifies_property(existence,X39)
| ~ object(X39) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_8,plain,
! [X30,X31] :
( ( property(X31)
| ~ is_the(X30,X31) )
& ( object(X30)
| ~ is_the(X30,X31) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[description_is_property_and_described_is_object])])]) ).
fof(c_0_9,plain,
! [X32,X33] :
( ( exemplifies_property(conceivable,X32)
| ~ exemplifies_property(none_greater,X32)
| ~ object(X32) )
& ( ~ object(X33)
| ~ exemplifies_relation(greater_than,X33,X32)
| ~ exemplifies_property(conceivable,X33)
| ~ exemplifies_property(none_greater,X32)
| ~ object(X32) )
& ( object(esk3_1(X32))
| ~ exemplifies_property(conceivable,X32)
| exemplifies_property(none_greater,X32)
| ~ object(X32) )
& ( exemplifies_relation(greater_than,esk3_1(X32),X32)
| ~ exemplifies_property(conceivable,X32)
| exemplifies_property(none_greater,X32)
| ~ object(X32) )
& ( exemplifies_property(conceivable,esk3_1(X32))
| ~ exemplifies_property(conceivable,X32)
| exemplifies_property(none_greater,X32)
| ~ object(X32) ) ),
inference(distribute,[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_10,plain,
( exemplifies_relation(greater_than,esk6_1(X1),X1)
| exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater)
| ~ object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( object(X1)
| ~ is_the(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( object(esk6_1(X1))
| exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater)
| ~ object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( exemplifies_property(conceivable,esk6_1(X1))
| exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater)
| ~ object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_14,plain,
! [X27,X28,X29] :
( ~ property(X27)
| ~ object(X28)
| ~ is_the(X28,X27)
| ~ object(X29)
| ~ is_the(X29,X27)
| exemplifies_property(X27,X29) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[description_theorem_2])])]) ).
fof(c_0_15,negated_conjecture,
~ exemplifies_property(existence,god),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[god_exists])]) ).
cnf(c_0_16,plain,
( ~ object(X1)
| ~ exemplifies_relation(greater_than,X1,X2)
| ~ exemplifies_property(conceivable,X1)
| ~ exemplifies_property(none_greater,X2)
| ~ object(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
( exemplifies_relation(greater_than,esk6_1(X1),X1)
| exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater) ),
inference(csr,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_18,plain,
( exemplifies_property(existence,X1)
| object(esk6_1(X1))
| ~ is_the(X1,none_greater) ),
inference(csr,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_19,plain,
( exemplifies_property(conceivable,esk6_1(X1))
| exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater) ),
inference(csr,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_20,plain,
( exemplifies_property(X1,X3)
| ~ property(X1)
| ~ object(X2)
| ~ is_the(X2,X1)
| ~ object(X3)
| ~ is_the(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( property(X1)
| ~ is_the(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,negated_conjecture,
~ exemplifies_property(existence,god),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
( exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater)
| ~ exemplifies_property(none_greater,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_11]),c_0_18]),c_0_19]) ).
cnf(c_0_24,plain,
is_the(god,none_greater),
inference(split_conjunct,[status(thm)],[definition_god]) ).
cnf(c_0_25,plain,
( exemplifies_property(X1,X2)
| ~ is_the(X2,X1)
| ~ is_the(X3,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_20,c_0_21]),c_0_11]),c_0_11]) ).
cnf(c_0_26,negated_conjecture,
~ exemplifies_property(none_greater,god),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_27,plain,
( exemplifies_property(none_greater,X1)
| ~ is_the(X1,none_greater) ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PHI013+1 : TPTP v9.2.1. Released v7.2.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n002.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 01:25:31 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.28/1.72 % Version : CSE_E---1.7
% 1.28/1.72 % Problem : theBenchmark.p
% 1.28/1.72 % SZS status Theorem for theBenchmark.p
% 1.28/1.72 % SZS output start CNFRefutation
% See solution above
% 1.28/1.72 % Total time : 1.370s
%------------------------------------------------------------------------------