TSTP Solution File: PHI013+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : PHI013+1 : TPTP v8.1.2. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 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 : Thu Aug 31 12:54:47 EDT 2023
% Result : Theorem 0.20s 0.61s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 22
% Syntax : Number of formulae : 48 ( 11 unt; 16 typ; 0 def)
% Number of atoms : 121 ( 0 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 145 ( 56 ~; 60 |; 18 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 9 >; 5 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 38 ( 3 sgn; 15 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
property: $i > $o ).
tff(decl_23,type,
object: $i > $o ).
tff(decl_24,type,
exemplifies_property: ( $i * $i ) > $o ).
tff(decl_25,type,
is_the: ( $i * $i ) > $o ).
tff(decl_26,type,
none_greater: $i ).
tff(decl_27,type,
conceivable: $i ).
tff(decl_28,type,
greater_than: $i ).
tff(decl_29,type,
exemplifies_relation: ( $i * $i * $i ) > $o ).
tff(decl_30,type,
existence: $i ).
tff(decl_31,type,
god: $i ).
tff(decl_32,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_33,type,
esk2_1: $i > $i ).
tff(decl_34,type,
esk3_1: $i > $i ).
tff(decl_35,type,
esk4_0: $i ).
tff(decl_36,type,
esk5_0: $i ).
tff(decl_37,type,
esk6_1: $i > $i ).
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/sandbox2/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/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(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(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/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,
! [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,
! [X22] :
( ( object(esk6_1(X22))
| ~ is_the(X22,none_greater)
| exemplifies_property(existence,X22)
| ~ object(X22) )
& ( exemplifies_relation(greater_than,esk6_1(X22),X22)
| ~ is_the(X22,none_greater)
| exemplifies_property(existence,X22)
| ~ object(X22) )
& ( exemplifies_property(conceivable,esk6_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])])])]) ).
fof(c_0_8,plain,
! [X13,X14] :
( ( property(X14)
| ~ is_the(X13,X14) )
& ( object(X13)
| ~ is_the(X13,X14) ) ),
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,negated_conjecture,
~ exemplifies_property(existence,god),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[god_exists])]) ).
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,
( 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]) ).
cnf(c_0_13,plain,
( object(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,
! [X10,X11,X12] :
( ~ property(X10)
| ~ object(X11)
| ~ is_the(X11,X10)
| ~ object(X12)
| ~ is_the(X12,X10)
| exemplifies_property(X10,X12) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[description_theorem_2])])]) ).
fof(c_0_15,plain,
! [X15,X16] :
( ( exemplifies_property(conceivable,X15)
| ~ exemplifies_property(none_greater,X15)
| ~ object(X15) )
& ( ~ object(X16)
| ~ exemplifies_relation(greater_than,X16,X15)
| ~ exemplifies_property(conceivable,X16)
| ~ exemplifies_property(none_greater,X15)
| ~ object(X15) )
& ( object(esk3_1(X15))
| ~ exemplifies_property(conceivable,X15)
| exemplifies_property(none_greater,X15)
| ~ object(X15) )
& ( exemplifies_relation(greater_than,esk3_1(X15),X15)
| ~ exemplifies_property(conceivable,X15)
| exemplifies_property(none_greater,X15)
| ~ object(X15) )
& ( exemplifies_property(conceivable,esk3_1(X15))
| ~ exemplifies_property(conceivable,X15)
| exemplifies_property(none_greater,X15)
| ~ object(X15) ) ),
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_16,negated_conjecture,
~ exemplifies_property(existence,god),
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,
is_the(god,none_greater),
inference(split_conjunct,[status(thm)],[definition_god]) ).
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_12,c_0_11]) ).
cnf(c_0_20,plain,
( exemplifies_property(existence,X1)
| object(esk6_1(X1))
| ~ is_the(X1,none_greater) ),
inference(csr,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_21,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_22,plain,
( property(X1)
| ~ is_the(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,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_15]) ).
cnf(c_0_24,negated_conjecture,
exemplifies_relation(greater_than,esk6_1(god),god),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_25,negated_conjecture,
exemplifies_property(conceivable,esk6_1(god)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_19]),c_0_18])]) ).
cnf(c_0_26,plain,
object(god),
inference(spm,[status(thm)],[c_0_11,c_0_18]) ).
cnf(c_0_27,negated_conjecture,
object(esk6_1(god)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_20]),c_0_18])]) ).
cnf(c_0_28,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_21,c_0_22]),c_0_11]),c_0_11]) ).
cnf(c_0_29,negated_conjecture,
~ exemplifies_property(none_greater,god),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_30,plain,
( exemplifies_property(none_greater,X1)
| ~ is_the(X1,none_greater) ),
inference(spm,[status(thm)],[c_0_28,c_0_18]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : PHI013+1 : TPTP v8.1.2. Released v7.2.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n002.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun Aug 27 09:06:33 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.60 start to proof: theBenchmark
% 0.20/0.61 % Version : CSE_E---1.5
% 0.20/0.61 % Problem : theBenchmark.p
% 0.20/0.61 % Proof found
% 0.20/0.61 % SZS status Theorem for theBenchmark.p
% 0.20/0.61 % SZS output start Proof
% See solution above
% 0.20/0.62 % Total time : 0.009000 s
% 0.20/0.62 % SZS output end Proof
% 0.20/0.62 % Total time : 0.012000 s
%------------------------------------------------------------------------------