%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : PHI011+1 : TPTP v8.2.0. Released v7.2.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % Computer : n013.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 : Mon Jun 24 13:33:53 EDT 2024 % Result : Theorem 0.20s 0.60s % Output : CNFRefutation 0.56s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : PHI011+1 : TPTP v8.2.0. Released v7.2.0. % 0.07/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.13/0.34 % Computer : n013.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 : Tue Jun 18 20:18:09 EDT 2024 % 0.13/0.34 % CPUTime : % 0.20/0.56 start to proof:theBenchmark % 0.20/0.59 %------------------------------------------- % 0.20/0.59 % File :CSE---1.7 % 0.20/0.59 % Problem :theBenchmark % 0.20/0.59 % Transform :cnf % 0.20/0.60 % Format :tptp:raw % 0.20/0.60 % Command :java -jar mcs_scs.jar %d %s % 0.20/0.60 % 0.20/0.60 % Result :Theorem 0.000000s % 0.20/0.60 % Output :CNFRefutation 0.000000s % 0.20/0.60 %------------------------------------------- % 0.20/0.60 %------------------------------------------------------------------------------ % 0.20/0.60 % File : PHI011+1 : TPTP v8.2.0. Released v7.2.0. % 0.20/0.60 % Domain : Philosophy % 0.20/0.60 % Problem : Lemma for Anselm's ontological argument % 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 : descripthm2.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 : 5 ( 0 unt; 0 def) % 0.20/0.60 % Number of atoms : 20 ( 1 equ) % 0.20/0.60 % Maximal formula atoms : 6 ( 4 avg) % 0.20/0.60 % Number of connectives : 16 ( 1 ~; 0 |; 6 &) % 0.20/0.60 % ( 0 <=>; 9 =>; 0 <=; 0 <~>) % 0.20/0.60 % Maximal formula depth : 7 ( 6 avg) % 0.20/0.60 % Maximal term depth : 1 ( 1 avg) % 0.20/0.60 % Number of predicates : 5 ( 4 usr; 0 prp; 1-2 aty) % 0.20/0.60 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.20/0.60 % Number of variables : 11 ( 10 !; 1 ?) % 0.20/0.60 % SPC : FOF_THM_EPR_SEQ % 0.20/0.60 % 0.20/0.60 % Comments : See http://mally.stanford.edu/cm/ontological-argument/ % 0.20/0.60 %------------------------------------------------------------------------------ % 0.20/0.60 fof(objects_are_not_properties,axiom, % 0.20/0.60 ! [X] : % 0.20/0.60 ( object(X) % 0.20/0.60 => ~ property(X) ) ). % 0.20/0.60 % 0.20/0.60 fof(exemplifier_is_object_and_exemplified_is_property,axiom, % 0.20/0.60 ! [X,F] : % 0.20/0.60 ( exemplifies_property(F,X) % 0.20/0.60 => ( property(F) % 0.20/0.60 & object(X) ) ) ). % 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(lemma_1,axiom, % 0.20/0.60 ! [X,F,Y] : % 0.20/0.60 ( ( object(X) % 0.20/0.60 & property(F) % 0.20/0.60 & object(Y) ) % 0.20/0.60 => ( ( is_the(X,F) % 0.20/0.60 & X = Y ) % 0.20/0.60 => exemplifies_property(F,Y) ) ) ). % 0.20/0.60 % 0.20/0.60 fof(description_theorem_2,conjecture, % 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 %------------------------------------------------------------------------------ % 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:21(EqnAxiom:9) % 0.20/0.60 %VarNum:23(SingletonVarNum:12) % 0.20/0.60 %MaxLitNum:6 % 0.20/0.60 %MaxfuncDepth:0 % 0.20/0.60 %SharedTerms:9 % 0.20/0.60 %goalClause: 10 11 12 13 14 15 % 0.20/0.60 %singleGoalClaCount:6 % 0.20/0.60 [10]P1(a1) % 0.20/0.60 [11]P1(a3) % 0.20/0.60 [12]P4(a2) % 0.20/0.60 [13]P2(a1,a2) % 0.20/0.60 [14]P2(a3,a2) % 0.20/0.60 [15]~P3(a2,a3) % 0.20/0.60 [16]~P4(x161)+~P1(x161) % 0.20/0.60 [17]P1(x171)+~P3(x172,x171) % 0.20/0.60 [18]P1(x181)+~P2(x181,x182) % 0.20/0.60 [19]P4(x191)+~P3(x191,x192) % 0.20/0.60 [20]P4(x201)+~P2(x202,x201) % 0.20/0.60 [21]~P1(x212)+~P1(x213)+~P4(x211)+~P2(x213,x211)+P3(x211,x212)+~E(x213,x212) % 0.20/0.60 %EqnAxiom % 0.20/0.60 [1]E(x11,x11) % 0.20/0.60 [2]E(x22,x21)+~E(x21,x22) % 0.20/0.60 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 0.20/0.60 [4]~P1(x41)+P1(x42)+~E(x41,x42) % 0.20/0.60 [5]P2(x52,x53)+~E(x51,x52)+~P2(x51,x53) % 0.20/0.60 [6]P2(x63,x62)+~E(x61,x62)+~P2(x63,x61) % 0.20/0.60 [7]~P4(x71)+P4(x72)+~E(x71,x72) % 0.20/0.60 [8]P3(x82,x83)+~E(x81,x82)+~P3(x81,x83) % 0.20/0.60 [9]P3(x93,x92)+~E(x91,x92)+~P3(x93,x91) % 0.20/0.60 % 0.20/0.60 %------------------------------------------- % 0.20/0.61 cnf(22,plain, % 0.56/0.61 (~P2(x221,x222)+P3(x222,x221)+~P1(x221)+~P1(x221)+~P4(x222)), % 0.56/0.61 inference(equality_inference,[],[21])). % 0.56/0.61 cnf(30,plain, % 0.56/0.61 ($false), % 0.56/0.61 inference(scs_inference,[],[10,11,12,13,14,15,16,19,20,6,22]), % 0.56/0.61 ['proof']). % 0.56/0.61 % SZS output end Proof % 0.56/0.61 % Total time :0.000000s %------------------------------------------------------------------------------