TSTP Solution File: PHI014+1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : PHI014+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 %s %d
% Computer : n028.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:39 EDT 2023
% Result : Theorem 0.20s 0.60s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PHI014+1 : TPTP v8.1.2. Released v7.2.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun Aug 27 09:07:53 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.54 start to proof:theBenchmark
% 0.20/0.59 %-------------------------------------------
% 0.20/0.59 % File :CSE---1.6
% 0.20/0.59 % Problem :theBenchmark
% 0.20/0.59 % Transform :cnf
% 0.20/0.59 % Format :tptp:raw
% 0.20/0.59 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.59
% 0.20/0.59 % Result :Theorem 0.000000s
% 0.20/0.59 % Output :CNFRefutation 0.000000s
% 0.20/0.59 %-------------------------------------------
% 0.20/0.60 %------------------------------------------------------------------------------
% 0.20/0.60 % File : PHI014+1 : TPTP v8.1.2. Released v7.2.0.
% 0.20/0.60 % Domain : Philosophy
% 0.20/0.60 % Problem : Anselm's ontological argument, simplified
% 0.20/0.60 % Version : [Wol16] axioms.
% 0.20/0.60 % English :
% 0.20/0.60
% 0.20/0.60 % Refs : [OZ11] Oppenheimer & Zalta (2011), A Computationally-Discover
% 0.20/0.60 % : [Wol16] Woltzenlogel Paleo (2016), Email to Geoff Sutcliffe
% 0.20/0.60 % Source : [Wol16]
% 0.20/0.60 % Names : ontological-simplified.p [Wol16]
% 0.20/0.60
% 0.20/0.60 % Status : Theorem
% 0.20/0.60 % Rating : 0.00 v7.2.0
% 0.20/0.60 % Syntax : Number of formulae : 6 ( 2 unt; 0 def)
% 0.20/0.60 % Number of atoms : 23 ( 0 equ)
% 0.20/0.60 % Maximal formula atoms : 6 ( 3 avg)
% 0.20/0.60 % Number of connectives : 19 ( 2 ~; 0 |; 8 &)
% 0.20/0.60 % ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% 0.20/0.60 % Maximal formula depth : 9 ( 5 avg)
% 0.20/0.60 % Maximal term depth : 1 ( 1 avg)
% 0.20/0.60 % Number of predicates : 5 ( 5 usr; 0 prp; 1-3 aty)
% 0.20/0.60 % Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% 0.20/0.60 % Number of variables : 9 ( 6 !; 3 ?)
% 0.20/0.60 % SPC : FOF_THM_RFO_NEQ
% 0.20/0.60
% 0.20/0.60 % Comments : See http://mally.stanford.edu/cm/ontological-argument/
% 0.20/0.60 % : This contains only the axioms used by Prover9 in it's proof.
% 0.20/0.60 %------------------------------------------------------------------------------
% 0.20/0.60 fof(description_theorem_2,axiom,
% 0.20/0.60 ! [F] :
% 0.20/0.60 ( property(F)
% 0.20/0.60 => ( ? [Y] :
% 0.20/0.60 ( object(Y)
% 0.20/0.60 & is_the(Y,F) )
% 0.20/0.60 => ! [Z] :
% 0.20/0.60 ( object(Z)
% 0.20/0.60 => ( is_the(Z,F)
% 0.20/0.60 => exemplifies_property(F,Z) ) ) ) ) ).
% 0.20/0.60
% 0.20/0.60 fof(description_is_property_and_described_is_object,axiom,
% 0.20/0.60 ! [X,F] :
% 0.20/0.60 ( is_the(X,F)
% 0.20/0.60 => ( property(F)
% 0.20/0.60 & object(X) ) ) ).
% 0.20/0.60
% 0.20/0.60 fof(definition_none_greater,axiom,
% 0.20/0.60 ! [X] :
% 0.20/0.60 ( object(X)
% 0.20/0.60 => ( exemplifies_property(none_greater,X)
% 0.20/0.60 <=> ( exemplifies_property(conceivable,X)
% 0.20/0.60 & ~ ? [Y] :
% 0.20/0.60 ( object(Y)
% 0.20/0.60 & exemplifies_relation(greater_than,Y,X)
% 0.20/0.60 & exemplifies_property(conceivable,Y) ) ) ) ) ).
% 0.20/0.60
% 0.20/0.60 fof(premise_2,axiom,
% 0.20/0.60 ! [X] :
% 0.20/0.60 ( object(X)
% 0.20/0.60 => ( ( is_the(X,none_greater)
% 0.20/0.60 & ~ exemplifies_property(existence,X) )
% 0.20/0.60 => ? [Y] :
% 0.20/0.60 ( object(Y)
% 0.20/0.60 & exemplifies_relation(greater_than,Y,X)
% 0.20/0.60 & exemplifies_property(conceivable,Y) ) ) ) ).
% 0.20/0.60
% 0.20/0.60 fof(definition_god,axiom,
% 0.20/0.60 is_the(god,none_greater) ).
% 0.20/0.60
% 0.20/0.60 fof(god_exists,conjecture,
% 0.20/0.60 exemplifies_property(existence,god) ).
% 0.20/0.60
% 0.20/0.60 %------------------------------------------------------------------------------
% 0.20/0.60 %-------------------------------------------
% 0.20/0.60 % Proof found
% 0.20/0.60 % SZS status Theorem for theBenchmark
% 0.20/0.60 % SZS output start Proof
% 0.20/0.60 %ClaNum:13(EqnAxiom:0)
% 0.20/0.60 %VarNum:50(SingletonVarNum:16)
% 0.20/0.60 %MaxLitNum:6
% 0.20/0.60 %MaxfuncDepth:1
% 0.20/0.60 %SharedTerms:7
% 0.20/0.60 %goalClause: 2
% 0.20/0.60 %singleGoalClaCount:1
% 0.20/0.60 [1]P1(a1,a6)
% 0.20/0.60 [2]~P2(a2,a1)
% 0.20/0.60 [3]P4(x31)+~P1(x32,x31)
% 0.20/0.60 [4]P5(x41)+~P1(x41,x42)
% 0.20/0.60 [5]~P5(x51)+~P2(a6,x51)+P2(a3,x51)
% 0.20/0.60 [6]~P5(x61)+P2(a2,x61)+~P1(x61,a6)+P5(f4(x61))
% 0.20/0.60 [7]~P5(x71)+P2(a6,x71)+~P2(a3,x71)+P5(f5(x71))
% 0.20/0.60 [8]~P5(x81)+~P1(x81,a6)+P2(a2,x81)+P2(a3,f4(x81))
% 0.20/0.60 [9]~P5(x91)+~P2(a3,x91)+P2(a6,x91)+P2(a3,f5(x91))
% 0.20/0.60 [11]~P5(x111)+~P1(x111,a6)+P2(a2,x111)+P3(a7,f4(x111),x111)
% 0.20/0.60 [12]~P5(x121)+~P2(a3,x121)+P2(a6,x121)+P3(a7,f5(x121),x121)
% 0.20/0.60 [13]~P5(x131)+~P5(x132)+~P3(a7,x132,x131)+~P2(a6,x131)+~P2(a3,x132)
% 0.20/0.60 [10]~P4(x101)+~P5(x102)+~P1(x102,x101)+~P1(x103,x101)+P2(x101,x102)+~P5(x103)
% 0.20/0.60 %EqnAxiom
% 0.20/0.60
% 0.20/0.60 %-------------------------------------------
% 0.20/0.61 cnf(14,plain,
% 0.20/0.61 (P5(a1)),
% 0.20/0.61 inference(scs_inference,[],[1,4])).
% 0.20/0.61 cnf(15,plain,
% 0.20/0.61 (P4(a6)),
% 0.20/0.61 inference(scs_inference,[],[1,4,3])).
% 0.20/0.61 cnf(21,plain,
% 0.20/0.61 (~P2(a6,a1)),
% 0.20/0.61 inference(scs_inference,[],[2,1,4,3,11,8,6,13])).
% 0.20/0.61 cnf(31,plain,
% 0.20/0.61 ($false),
% 0.20/0.61 inference(scs_inference,[],[1,21,14,15,10]),
% 0.20/0.61 ['proof']).
% 0.20/0.61 % SZS output end Proof
% 0.20/0.61 % Total time :0.000000s
%------------------------------------------------------------------------------