%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : PHI014+1 : TPTP v9.2.1. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n004.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.24s 1.71s
% Output : CNFRefutation 1.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 11 unt; 0 def)
% Number of atoms : 121 ( 0 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 144 ( 55 ~; 60 |; 18 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 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 : 38 ( 4 sgn 15 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(premise_2,axiom,
! [X4] :
( object(X4)
=> ( ( is_the(X4,none_greater)
& ~ exemplifies_property(existence,X4) )
=> ? [X2] :
( object(X2)
& exemplifies_relation(greater_than,X2,X4)
& exemplifies_property(conceivable,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_2) ).
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/sandbox2/benchmark/theBenchmark.p',description_theorem_2) ).
fof(description_is_property_and_described_is_object,axiom,
! [X4,X1] :
( is_the(X4,X1)
=> ( property(X1)
& object(X4) ) ),
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_god,axiom,
is_the(god,none_greater),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_god) ).
fof(definition_none_greater,axiom,
! [X4] :
( object(X4)
=> ( exemplifies_property(none_greater,X4)
<=> ( exemplifies_property(conceivable,X4)
& ~ ? [X2] :
( object(X2)
& exemplifies_relation(greater_than,X2,X4)
& exemplifies_property(conceivable,X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_none_greater) ).
fof(c_0_6,plain,
! [X4] :
( object(X4)
=> ( ( is_the(X4,none_greater)
& ~ exemplifies_property(existence,X4) )
=> ? [X2] :
( object(X2)
& exemplifies_relation(greater_than,X2,X4)
& exemplifies_property(conceivable,X2) ) ) ),
inference(fof_simplification,[status(thm)],[premise_2]) ).
fof(c_0_7,plain,
! [X14,X15,X16] :
( ~ property(X14)
| ~ object(X15)
| ~ is_the(X15,X14)
| ~ object(X16)
| ~ is_the(X16,X14)
| exemplifies_property(X14,X16) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[description_theorem_2])])]) ).
fof(c_0_8,plain,
! [X17,X18] :
( ( property(X18)
| ~ is_the(X17,X18) )
& ( object(X17)
| ~ is_the(X17,X18) ) ),
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,
! [X22] :
( ( object(esk2_1(X22))
| ~ is_the(X22,none_greater)
| exemplifies_property(existence,X22)
| ~ object(X22) )
& ( exemplifies_relation(greater_than,esk2_1(X22),X22)
| ~ is_the(X22,none_greater)
| exemplifies_property(existence,X22)
| ~ object(X22) )
& ( exemplifies_property(conceivable,esk2_1(X22))
| ~ is_the(X22,none_greater)
| exemplifies_property(existence,X22)
| ~ object(X22) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_10,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_7]) ).
cnf(c_0_11,plain,
( property(X1)
| ~ is_the(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( object(X1)
| ~ is_the(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( exemplifies_relation(greater_than,esk2_1(X1),X1)
| exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater)
| ~ object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,negated_conjecture,
~ exemplifies_property(existence,god),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[god_exists])]) ).
cnf(c_0_15,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_10,c_0_11]),c_0_12]),c_0_12]) ).
cnf(c_0_16,plain,
is_the(god,none_greater),
inference(split_conjunct,[status(thm)],[definition_god]) ).
cnf(c_0_17,plain,
( exemplifies_property(conceivable,esk2_1(X1))
| exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater)
| ~ object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,plain,
( object(esk2_1(X1))
| exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater)
| ~ object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_19,plain,
! [X19,X20] :
( ( exemplifies_property(conceivable,X19)
| ~ exemplifies_property(none_greater,X19)
| ~ object(X19) )
& ( ~ object(X20)
| ~ exemplifies_relation(greater_than,X20,X19)
| ~ exemplifies_property(conceivable,X20)
| ~ exemplifies_property(none_greater,X19)
| ~ object(X19) )
& ( object(esk1_1(X19))
| ~ exemplifies_property(conceivable,X19)
| exemplifies_property(none_greater,X19)
| ~ object(X19) )
& ( exemplifies_relation(greater_than,esk1_1(X19),X19)
| ~ exemplifies_property(conceivable,X19)
| exemplifies_property(none_greater,X19)
| ~ object(X19) )
& ( exemplifies_property(conceivable,esk1_1(X19))
| ~ exemplifies_property(conceivable,X19)
| exemplifies_property(none_greater,X19)
| ~ object(X19) ) ),
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_20,plain,
( exemplifies_relation(greater_than,esk2_1(X1),X1)
| exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater) ),
inference(csr,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_21,negated_conjecture,
~ exemplifies_property(existence,god),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( exemplifies_property(none_greater,god)
| ~ is_the(X1,none_greater) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
( exemplifies_property(conceivable,esk2_1(X1))
| exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater) ),
inference(csr,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_24,plain,
( exemplifies_property(existence,X1)
| object(esk2_1(X1))
| ~ is_the(X1,none_greater) ),
inference(csr,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_25,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_19]) ).
cnf(c_0_26,plain,
exemplifies_relation(greater_than,esk2_1(god),god),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_16]),c_0_21]) ).
cnf(c_0_27,plain,
exemplifies_property(none_greater,god),
inference(spm,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_28,plain,
exemplifies_property(conceivable,esk2_1(god)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_16]),c_0_21]) ).
cnf(c_0_29,plain,
object(god),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_30,plain,
object(esk2_1(god)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_16]),c_0_21]) ).
cnf(c_0_31,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28]),c_0_29]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PHI014+1 : TPTP v9.2.1. Released v7.2.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n004.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 01:25:02 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.24/1.71 % Version : CSE_E---1.7
% 1.24/1.71 % Problem : theBenchmark.p
% 1.24/1.71 % SZS status Theorem for theBenchmark.p
% 1.24/1.71 % SZS output start CNFRefutation
% See solution above
% 1.24/1.71 % Total time : 1.369s
%------------------------------------------------------------------------------