%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : PHI012+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 : n008.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.56s 0.69s % Output : CNFRefutation 0.56s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : PHI012+1 : TPTP v8.2.0. Released v7.2.0. % 0.03/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.13/0.34 % Computer : n008.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:22:24 EDT 2024 % 0.13/0.34 % CPUTime : % 0.52/0.60 start to proof:theBenchmark % 0.56/0.69 %------------------------------------------- % 0.56/0.69 % File :CSE---1.7 % 0.56/0.69 % Problem :theBenchmark % 0.56/0.69 % Transform :cnf % 0.56/0.69 % Format :tptp:raw % 0.56/0.69 % Command :java -jar mcs_scs.jar %d %s % 0.56/0.69 % 0.56/0.69 % Result :Theorem 0.050000s % 0.56/0.69 % Output :CNFRefutation 0.050000s % 0.56/0.69 %------------------------------------------- % 0.56/0.69 %------------------------------------------------------------------------------ % 0.56/0.69 % File : PHI012+1 : TPTP v8.2.0. Released v7.2.0. % 0.56/0.69 % Domain : Philosophy % 0.56/0.69 % Problem : Lemma for Anselm's ontological argument % 0.56/0.69 % Version : [Wol16] axioms. % 0.56/0.69 % English : % 0.56/0.69 % 0.56/0.69 % Refs : [OZ11] Oppenheimer & Zalta (2011), A Computationally-Discover % 0.56/0.69 % : [Wol16] Woltzenlogel Paleo (2016), Email to Geoff Sutcliffe % 0.56/0.69 % Source : [Wol16] % 0.56/0.69 % Names : lemma2.p [Wol16] % 0.56/0.69 % 0.56/0.69 % Status : Theorem % 0.56/0.69 % Rating : 0.06 v8.1.0, 0.03 v7.2.0 % 0.56/0.69 % Syntax : Number of formulae : 3 ( 0 unt; 0 def) % 0.56/0.69 % Number of atoms : 18 ( 2 equ) % 0.56/0.69 % Maximal formula atoms : 7 ( 6 avg) % 0.56/0.69 % Number of connectives : 16 ( 1 ~; 2 |; 7 &) % 0.56/0.69 % ( 1 <=>; 5 =>; 0 <=; 0 <~>) % 0.56/0.69 % Maximal formula depth : 9 ( 8 avg) % 0.56/0.69 % Maximal term depth : 1 ( 1 avg) % 0.56/0.69 % Number of predicates : 4 ( 3 usr; 0 prp; 1-3 aty) % 0.56/0.69 % Number of functors : 3 ( 3 usr; 3 con; 0-0 aty) % 0.56/0.69 % Number of variables : 7 ( 4 !; 3 ?) % 0.56/0.69 % SPC : FOF_THM_RFO_SEQ % 0.56/0.69 % 0.56/0.69 % Comments : See http://mally.stanford.edu/cm/ontological-argument/ % 0.56/0.69 %------------------------------------------------------------------------------ % 0.56/0.69 fof(definition_none_greater,axiom, % 0.56/0.69 ! [X] : % 0.56/0.69 ( object(X) % 0.56/0.69 => ( exemplifies_property(none_greater,X) % 0.56/0.69 <=> ( exemplifies_property(conceivable,X) % 0.56/0.69 & ~ ? [Y] : % 0.56/0.69 ( object(Y) % 0.56/0.69 & exemplifies_relation(greater_than,Y,X) % 0.56/0.69 & exemplifies_property(conceivable,Y) ) ) ) ) ). % 0.56/0.69 % 0.56/0.69 fof(connectedness_of_greater_than,axiom, % 0.56/0.69 ! [X,Y] : % 0.56/0.69 ( ( object(X) % 0.56/0.69 & object(Y) ) % 0.56/0.69 => ( exemplifies_relation(greater_than,X,Y) % 0.56/0.69 | exemplifies_relation(greater_than,Y,X) % 0.56/0.69 | X = Y ) ) ). % 0.56/0.69 % 0.56/0.69 fof(lemma_2,conjecture, % 0.56/0.69 ( ? [X] : % 0.56/0.69 ( object(X) % 0.56/0.69 & exemplifies_property(none_greater,X) ) % 0.56/0.69 => ? [X] : % 0.56/0.69 ( object(X) % 0.56/0.69 & exemplifies_property(none_greater,X) % 0.56/0.69 & ! [Y] : % 0.56/0.69 ( object(Y) % 0.56/0.69 => ( exemplifies_property(none_greater,Y) % 0.56/0.69 => Y = X ) ) ) ) ). % 0.56/0.69 % 0.56/0.69 %------------------------------------------------------------------------------ % 0.56/0.69 %------------------------------------------- % 0.56/0.69 % Proof found % 0.56/0.69 % SZS status Theorem for theBenchmark % 0.56/0.69 % SZS output start Proof % 0.56/0.69 %ClaNum:22(EqnAxiom:11) % 0.56/0.69 %VarNum:40(SingletonVarNum:11) % 0.56/0.69 %MaxLitNum:5 % 0.56/0.69 %MaxfuncDepth:1 % 0.56/0.69 %SharedTerms:6 % 0.56/0.69 %goalClause: 12 13 14 15 17 % 0.56/0.69 %singleGoalClaCount:2 % 0.56/0.69 [12]P1(a1) % 0.56/0.69 [13]P2(a4,a1) % 0.56/0.69 [16]~P1(x161)+~P2(a4,x161)+P2(a2,x161) % 0.56/0.69 [14]~P1(x141)+~P2(a4,x141)+~E(f5(x141),x141) % 0.56/0.69 [15]~P1(x151)+~P2(a4,x151)+P1(f5(x151)) % 0.56/0.69 [17]~P1(x171)+~P2(a4,x171)+P2(a4,f5(x171)) % 0.56/0.70 [18]~P1(x181)+P2(a4,x181)+~P2(a2,x181)+P1(f3(x181)) % 0.56/0.70 [19]~P1(x191)+~P2(a2,x191)+P2(a4,x191)+P2(a2,f3(x191)) % 0.56/0.70 [20]~P1(x201)+~P2(a2,x201)+P2(a4,x201)+P3(a6,f3(x201),x201) % 0.56/0.70 [21]~P1(x212)+~P1(x211)+E(x211,x212)+P3(a6,x212,x211)+P3(a6,x211,x212) % 0.56/0.70 [22]~P1(x221)+~P1(x222)+~P3(a6,x222,x221)+~P2(a4,x221)+~P2(a2,x222) % 0.56/0.70 %EqnAxiom % 0.56/0.70 [1]E(x11,x11) % 0.56/0.70 [2]E(x22,x21)+~E(x21,x22) % 0.56/0.70 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 0.56/0.70 [4]~E(x41,x42)+E(f5(x41),f5(x42)) % 0.56/0.70 [5]~E(x51,x52)+E(f3(x51),f3(x52)) % 0.56/0.70 [6]~P1(x61)+P1(x62)+~E(x61,x62) % 0.56/0.70 [7]P2(x72,x73)+~E(x71,x72)+~P2(x71,x73) % 0.56/0.70 [8]P2(x83,x82)+~E(x81,x82)+~P2(x83,x81) % 0.56/0.70 [9]P3(x92,x93,x94)+~E(x91,x92)+~P3(x91,x93,x94) % 0.56/0.70 [10]P3(x103,x102,x104)+~E(x101,x102)+~P3(x103,x101,x104) % 0.56/0.70 [11]P3(x113,x114,x112)+~E(x111,x112)+~P3(x113,x114,x111) % 0.56/0.70 % 0.56/0.70 %------------------------------------------- % 0.56/0.70 cnf(23,plain, % 0.56/0.70 (~E(f5(a1),a1)), % 0.56/0.70 inference(scs_inference,[],[12,13,14])). % 0.56/0.70 cnf(25,plain, % 0.56/0.70 (P2(a2,a1)), % 0.56/0.70 inference(scs_inference,[],[12,13,14,16])). % 0.56/0.70 cnf(41,plain, % 0.56/0.70 (~E(f5(a1),x411)+P1(x411)), % 0.56/0.70 inference(scs_inference,[],[13,12,6,15])). % 0.56/0.70 cnf(42,plain, % 0.56/0.70 (P1(f5(a1))), % 0.56/0.70 inference(equality_inference,[],[41])). % 0.56/0.70 cnf(47,plain, % 0.56/0.70 (P2(a4,f5(a1))), % 0.56/0.70 inference(scs_inference,[],[13,12,17,6])). % 0.56/0.70 cnf(50,plain, % 0.56/0.70 (P2(a2,f5(a1))), % 0.56/0.70 inference(scs_inference,[],[47,42,14,16])). % 0.56/0.70 cnf(55,plain, % 0.56/0.70 (P3(a6,f5(a1),a1)), % 0.56/0.70 inference(scs_inference,[],[23,12,25,47,42,14,16,22,8,21])). % 0.56/0.70 cnf(74,plain, % 0.56/0.70 ($false), % 0.56/0.70 inference(scs_inference,[],[50,13,12,55,42,22]), % 0.56/0.70 ['proof']). % 0.56/0.70 % SZS output end Proof % 0.56/0.70 % Total time :0.050000s %------------------------------------------------------------------------------