%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SEU118+1 : TPTP v8.2.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % Computer : n023.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 15:01:06 EDT 2024 % Result : Theorem 0.56s 0.64s % Output : CNFRefutation 0.56s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : SEU118+1 : TPTP v8.2.0. Released v3.2.0. % 0.12/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n023.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.18/0.33 % DateTime : Fri Jun 21 11:20:54 EDT 2024 % 0.18/0.33 % CPUTime : % 0.19/0.56 start to proof:theBenchmark % 0.56/0.63 %------------------------------------------- % 0.56/0.63 % File :CSE---1.7 % 0.56/0.63 % Problem :theBenchmark % 0.56/0.63 % Transform :cnf % 0.56/0.63 % Format :tptp:raw % 0.56/0.63 % Command :java -jar mcs_scs.jar %d %s % 0.56/0.63 % 0.56/0.63 % Result :Theorem 0.010000s % 0.56/0.63 % Output :CNFRefutation 0.010000s % 0.56/0.63 %------------------------------------------- % 0.56/0.63 %------------------------------------------------------------------------------ % 0.56/0.63 % File : SEU118+1 : TPTP v8.2.0. Released v3.2.0. % 0.56/0.63 % Domain : Set theory % 0.56/0.63 % Problem : Boolean domains, theorem 34 % 0.56/0.63 % Version : [Urb06] axioms : Especial. % 0.56/0.63 % English : % 0.56/0.63 % 0.56/0.63 % Refs : [TD90] Trybulec & Darmochwal (1990), Boolean Domains % 0.56/0.63 % : [Urb06] Urban (2006), Email to G. Sutcliffe % 0.56/0.63 % Source : [Urb06] % 0.56/0.63 % Names : finsub_1__t34_finsub_1 [Urb06] % 0.56/0.63 % 0.56/0.63 % Status : Theorem % 0.56/0.63 % Rating : 0.11 v8.2.0, 0.14 v7.5.0, 0.12 v7.4.0, 0.03 v7.1.0, 0.04 v7.0.0, 0.03 v6.4.0, 0.08 v6.3.0, 0.04 v6.2.0, 0.12 v6.1.0, 0.27 v6.0.0, 0.22 v5.5.0, 0.19 v5.4.0, 0.14 v5.3.0, 0.22 v5.2.0, 0.00 v5.0.0, 0.12 v4.1.0, 0.13 v4.0.0, 0.12 v3.7.0, 0.10 v3.5.0, 0.11 v3.3.0, 0.07 v3.2.0 % 0.56/0.63 % Syntax : Number of formulae : 33 ( 7 unt; 0 def) % 0.56/0.63 % Number of atoms : 91 ( 3 equ) % 0.56/0.63 % Maximal formula atoms : 10 ( 2 avg) % 0.56/0.63 % Number of connectives : 75 ( 17 ~; 1 |; 36 &) % 0.56/0.63 % ( 3 <=>; 18 =>; 0 <=; 0 <~>) % 0.56/0.63 % Maximal formula depth : 12 ( 5 avg) % 0.56/0.63 % Maximal term depth : 2 ( 1 avg) % 0.56/0.63 % Number of predicates : 17 ( 16 usr; 0 prp; 1-2 aty) % 0.56/0.63 % Number of functors : 3 ( 3 usr; 1 con; 0-1 aty) % 0.56/0.63 % Number of variables : 55 ( 45 !; 10 ?) % 0.56/0.63 % SPC : FOF_THM_RFO_SEQ % 0.56/0.63 % 0.56/0.63 % Comments : Translated by MPTP 0.2 from the original problem in the Mizar % 0.56/0.63 % library, www.mizar.org % 0.56/0.63 %------------------------------------------------------------------------------ % 0.56/0.63 fof(antisymmetry_r2_hidden,axiom, % 0.56/0.63 ! [A,B] : % 0.56/0.63 ( in(A,B) % 0.56/0.63 => ~ in(B,A) ) ). % 0.56/0.63 % 0.56/0.63 fof(cc1_finset_1,axiom, % 0.56/0.63 ! [A] : % 0.56/0.63 ( empty(A) % 0.56/0.63 => finite(A) ) ). % 0.56/0.63 % 0.56/0.63 fof(cc1_finsub_1,axiom, % 0.56/0.63 ! [A] : % 0.56/0.63 ( preboolean(A) % 0.56/0.63 => ( cup_closed(A) % 0.56/0.63 & diff_closed(A) ) ) ). % 0.56/0.63 % 0.56/0.63 fof(cc2_finset_1,axiom, % 0.56/0.63 ! [A] : % 0.56/0.63 ( finite(A) % 0.56/0.63 => ! [B] : % 0.56/0.63 ( element(B,powerset(A)) % 0.56/0.64 => finite(B) ) ) ). % 0.56/0.64 % 0.56/0.64 fof(cc2_finsub_1,axiom, % 0.56/0.64 ! [A] : % 0.56/0.64 ( ( cup_closed(A) % 0.56/0.64 & diff_closed(A) ) % 0.56/0.64 => preboolean(A) ) ). % 0.56/0.64 % 0.56/0.64 fof(cc3_finsub_1,axiom, % 0.56/0.64 ! [A,B] : % 0.56/0.64 ( element(B,finite_subsets(A)) % 0.56/0.64 => finite(B) ) ). % 0.56/0.64 % 0.56/0.64 fof(d5_finsub_1,axiom, % 0.56/0.64 ! [A,B] : % 0.56/0.64 ( preboolean(B) % 0.56/0.64 => ( B = finite_subsets(A) % 0.56/0.64 <=> ! [C] : % 0.56/0.64 ( in(C,B) % 0.56/0.64 <=> ( subset(C,A) % 0.56/0.64 & finite(C) ) ) ) ) ). % 0.56/0.64 % 0.56/0.64 fof(dt_k5_finsub_1,axiom, % 0.56/0.64 ! [A] : preboolean(finite_subsets(A)) ). % 0.56/0.64 % 0.56/0.64 fof(existence_m1_subset_1,axiom, % 0.56/0.64 ! [A] : % 0.56/0.64 ? [B] : element(B,A) ). % 0.56/0.64 % 0.56/0.64 fof(fc1_finsub_1,axiom, % 0.56/0.64 ! [A] : % 0.56/0.64 ( ~ empty(powerset(A)) % 0.56/0.64 & cup_closed(powerset(A)) % 0.56/0.64 & diff_closed(powerset(A)) % 0.56/0.64 & preboolean(powerset(A)) ) ). % 0.56/0.64 % 0.56/0.64 fof(fc1_subset_1,axiom, % 0.56/0.64 ! [A] : ~ empty(powerset(A)) ). % 0.56/0.64 % 0.56/0.64 fof(fc1_xboole_0,axiom, % 0.56/0.64 empty(empty_set) ). % 0.56/0.64 % 0.56/0.64 fof(fc2_finsub_1,axiom, % 0.56/0.64 ! [A] : % 0.56/0.64 ( ~ empty(finite_subsets(A)) % 0.56/0.64 & cup_closed(finite_subsets(A)) % 0.56/0.64 & diff_closed(finite_subsets(A)) % 0.56/0.64 & preboolean(finite_subsets(A)) ) ). % 0.56/0.64 % 0.56/0.64 fof(rc1_finset_1,axiom, % 0.56/0.64 ? [A] : % 0.56/0.64 ( ~ empty(A) % 0.56/0.64 & finite(A) ) ). % 0.56/0.64 % 0.56/0.64 fof(rc1_finsub_1,axiom, % 0.56/0.64 ? [A] : % 0.56/0.64 ( ~ empty(A) % 0.56/0.64 & cup_closed(A) % 0.56/0.64 & cap_closed(A) % 0.56/0.64 & diff_closed(A) % 0.56/0.64 & preboolean(A) ) ). % 0.56/0.64 % 0.56/0.64 fof(rc1_subset_1,axiom, % 0.56/0.64 ! [A] : % 0.56/0.64 ( ~ empty(A) % 0.56/0.64 => ? [B] : % 0.56/0.64 ( element(B,powerset(A)) % 0.56/0.64 & ~ empty(B) ) ) ). % 0.56/0.64 % 0.56/0.64 fof(rc1_xboole_0,axiom, % 0.56/0.64 ? [A] : empty(A) ). % 0.56/0.64 % 0.56/0.64 fof(rc2_finset_1,axiom, % 0.56/0.64 ! [A] : % 0.56/0.64 ? [B] : % 0.56/0.64 ( element(B,powerset(A)) % 0.56/0.64 & empty(B) % 0.56/0.64 & relation(B) % 0.56/0.64 & function(B) % 0.56/0.64 & one_to_one(B) % 0.56/0.64 & epsilon_transitive(B) % 0.56/0.64 & epsilon_connected(B) % 0.56/0.64 & ordinal(B) % 0.56/0.64 & natural(B) % 0.56/0.64 & finite(B) ) ). % 0.56/0.64 % 0.56/0.64 fof(rc2_subset_1,axiom, % 0.56/0.64 ! [A] : % 0.56/0.64 ? [B] : % 0.56/0.64 ( element(B,powerset(A)) % 0.56/0.64 & empty(B) ) ). % 0.56/0.64 % 0.56/0.64 fof(rc2_xboole_0,axiom, % 0.56/0.64 ? [A] : ~ empty(A) ). % 0.56/0.64 % 0.56/0.64 fof(rc3_finset_1,axiom, % 0.56/0.64 ! [A] : % 0.56/0.64 ( ~ empty(A) % 0.56/0.64 => ? [B] : % 0.56/0.64 ( element(B,powerset(A)) % 0.56/0.64 & ~ empty(B) % 0.56/0.64 & finite(B) ) ) ). % 0.56/0.64 % 0.56/0.64 fof(rc4_finset_1,axiom, % 0.56/0.64 ! [A] : % 0.56/0.64 ( ~ empty(A) % 0.56/0.64 => ? [B] : % 0.56/0.64 ( element(B,powerset(A)) % 0.56/0.64 & ~ empty(B) % 0.56/0.64 & finite(B) ) ) ). % 0.56/0.64 % 0.56/0.64 fof(reflexivity_r1_tarski,axiom, % 0.56/0.64 ! [A,B] : subset(A,A) ). % 0.56/0.64 % 0.56/0.64 fof(t13_finset_1,axiom, % 0.56/0.64 ! [A,B] : % 0.56/0.64 ( ( subset(A,B) % 0.56/0.64 & finite(B) ) % 0.56/0.64 => finite(A) ) ). % 0.56/0.64 % 0.56/0.64 fof(t1_subset,axiom, % 0.56/0.64 ! [A,B] : % 0.56/0.64 ( in(A,B) % 0.56/0.64 => element(A,B) ) ). % 0.56/0.64 % 0.56/0.64 fof(t2_subset,axiom, % 0.56/0.64 ! [A,B] : % 0.56/0.64 ( element(A,B) % 0.56/0.64 => ( empty(B) % 0.56/0.64 | in(A,B) ) ) ). % 0.56/0.64 % 0.56/0.64 fof(t34_finsub_1,conjecture, % 0.56/0.64 ! [A,B] : % 0.56/0.64 ( element(B,powerset(A)) % 0.56/0.64 => ( finite(A) % 0.56/0.64 => element(B,finite_subsets(A)) ) ) ). % 0.56/0.64 % 0.56/0.64 fof(t3_subset,axiom, % 0.56/0.64 ! [A,B] : % 0.56/0.64 ( element(A,powerset(B)) % 0.56/0.64 <=> subset(A,B) ) ). % 0.56/0.64 % 0.56/0.64 fof(t4_subset,axiom, % 0.56/0.64 ! [A,B,C] : % 0.56/0.64 ( ( in(A,B) % 0.56/0.64 & element(B,powerset(C)) ) % 0.56/0.64 => element(A,C) ) ). % 0.56/0.64 % 0.56/0.64 fof(t5_subset,axiom, % 0.56/0.64 ! [A,B,C] : % 0.56/0.64 ~ ( in(A,B) % 0.56/0.64 & element(B,powerset(C)) % 0.56/0.64 & empty(C) ) ). % 0.56/0.64 % 0.56/0.64 fof(t6_boole,axiom, % 0.56/0.64 ! [A] : % 0.56/0.64 ( empty(A) % 0.56/0.64 => A = empty_set ) ). % 0.56/0.64 % 0.56/0.64 fof(t7_boole,axiom, % 0.56/0.64 ! [A,B] : % 0.56/0.64 ~ ( in(A,B) % 0.56/0.64 & empty(B) ) ). % 0.56/0.64 % 0.56/0.64 fof(t8_boole,axiom, % 0.56/0.64 ! [A,B] : % 0.56/0.64 ~ ( empty(A) % 0.56/0.64 & A != B % 0.56/0.64 & empty(B) ) ). % 0.56/0.64 % 0.56/0.64 %------------------------------------------------------------------------------ % 0.56/0.64 %------------------------------------------- % 0.56/0.64 % Proof found % 0.56/0.64 % SZS status Theorem for theBenchmark % 0.56/0.64 % SZS output start Proof % 0.56/0.64 %ClaNum:100(EqnAxiom:32) % 0.56/0.64 %VarNum:155(SingletonVarNum:76) % 0.56/0.64 %MaxLitNum:5 % 0.56/0.64 %MaxfuncDepth:1 % 0.56/0.64 %SharedTerms:22 % 0.56/0.64 %goalClause: 36 59 69 % 0.56/0.64 %singleGoalClaCount:3 % 0.56/0.64 [33]P1(a1) % 0.56/0.64 [34]P1(a2) % 0.56/0.64 [35]P6(a3) % 0.56/0.64 [36]P6(a4) % 0.56/0.64 [37]P9(a10) % 0.56/0.64 [38]P2(a10) % 0.56/0.64 [39]P4(a10) % 0.56/0.64 [40]P3(a10) % 0.56/0.64 [63]~P1(a3) % 0.56/0.64 [64]~P1(a10) % 0.56/0.64 [65]~P1(a16) % 0.56/0.64 [59]P5(a7,f14(a4)) % 0.56/0.64 [69]~P5(a7,f15(a4)) % 0.56/0.64 [58]P16(x581,x581) % 0.56/0.64 [41]P1(f12(x411)) % 0.56/0.64 [42]P1(f13(x421)) % 0.56/0.64 [43]P6(f12(x431)) % 0.56/0.64 [44]P9(f14(x441)) % 0.56/0.64 [46]P9(f15(x461)) % 0.56/0.64 [47]P2(f14(x471)) % 0.56/0.64 [48]P2(f15(x481)) % 0.56/0.64 [49]P4(f14(x491)) % 0.56/0.64 [50]P4(f15(x501)) % 0.56/0.64 [51]P15(f12(x511)) % 0.56/0.64 [52]P10(f12(x521)) % 0.56/0.64 [53]P11(f12(x531)) % 0.56/0.64 [54]P7(f12(x541)) % 0.56/0.64 [55]P8(f12(x551)) % 0.56/0.64 [56]P14(f12(x561)) % 0.56/0.64 [57]P12(f12(x571)) % 0.56/0.64 [60]P5(f8(x601),x601) % 0.56/0.64 [61]P5(f12(x611),f14(x611)) % 0.56/0.64 [62]P5(f13(x621),f14(x621)) % 0.56/0.64 [67]~P1(f14(x671)) % 0.56/0.64 [68]~P1(f15(x681)) % 0.56/0.64 [70]~P1(x701)+E(x701,a1) % 0.56/0.64 [71]~P1(x711)+P6(x711) % 0.56/0.64 [72]~P9(x721)+P2(x721) % 0.56/0.64 [73]~P9(x731)+P4(x731) % 0.56/0.64 [74]P1(x741)+P6(f5(x741)) % 0.56/0.64 [75]P1(x751)+P6(f6(x751)) % 0.56/0.64 [78]P1(x781)+~P1(f11(x781)) % 0.56/0.64 [79]P1(x791)+~P1(f5(x791)) % 0.56/0.64 [80]P1(x801)+~P1(f6(x801)) % 0.56/0.64 [82]P1(x821)+P5(f11(x821),f14(x821)) % 0.56/0.64 [83]P1(x831)+P5(f5(x831),f14(x831)) % 0.56/0.64 [84]P1(x841)+P5(f6(x841),f14(x841)) % 0.56/0.64 [81]~P1(x811)+~P13(x812,x811) % 0.56/0.64 [87]~P13(x871,x872)+P5(x871,x872) % 0.56/0.64 [92]~P13(x922,x921)+~P13(x921,x922) % 0.56/0.64 [86]P6(x861)+~P5(x861,f15(x862)) % 0.56/0.64 [90]~P16(x901,x902)+P5(x901,f14(x902)) % 0.56/0.64 [93]P16(x931,x932)+~P5(x931,f14(x932)) % 0.56/0.64 [77]~P2(x771)+~P4(x771)+P9(x771) % 0.56/0.64 [76]~P1(x762)+~P1(x761)+E(x761,x762) % 0.56/0.64 [85]~P16(x851,x852)+P6(x851)+~P6(x852) % 0.56/0.64 [88]~P5(x882,x881)+P1(x881)+P13(x882,x881) % 0.56/0.64 [91]P6(x911)+~P6(x912)+~P5(x911,f14(x912)) % 0.56/0.64 [96]~P1(x961)+~P13(x962,x963)+~P5(x963,f14(x961)) % 0.56/0.64 [97]P5(x971,x972)+~P13(x971,x973)+~P5(x973,f14(x972)) % 0.56/0.64 [98]~P9(x981)+P13(f9(x982,x981),x981)+E(x981,f15(x982))+P6(f9(x982,x981)) % 0.56/0.64 [99]~P9(x991)+P13(f9(x992,x991),x991)+P16(f9(x992,x991),x992)+E(x991,f15(x992)) % 0.56/0.64 [89]~P9(x892)+~P13(x891,x892)+P6(x891)+~E(x892,f15(x893)) % 0.56/0.64 [94]~P9(x943)+~P13(x941,x943)+P16(x941,x942)+~E(x943,f15(x942)) % 0.56/0.64 [100]~P9(x1001)+~P13(f9(x1002,x1001),x1001)+~P16(f9(x1002,x1001),x1002)+E(x1001,f15(x1002))+~P6(f9(x1002,x1001)) % 0.56/0.64 [95]~P6(x951)+~P9(x952)+~P16(x951,x953)+P13(x951,x952)+~E(x952,f15(x953)) % 0.56/0.64 %EqnAxiom % 0.56/0.64 [1]E(x11,x11) % 0.56/0.64 [2]E(x22,x21)+~E(x21,x22) % 0.56/0.64 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 0.56/0.64 [4]~E(x41,x42)+E(f12(x41),f12(x42)) % 0.56/0.64 [5]~E(x51,x52)+E(f13(x51),f13(x52)) % 0.56/0.64 [6]~E(x61,x62)+E(f9(x61,x63),f9(x62,x63)) % 0.56/0.64 [7]~E(x71,x72)+E(f9(x73,x71),f9(x73,x72)) % 0.56/0.64 [8]~E(x81,x82)+E(f14(x81),f14(x82)) % 0.56/0.64 [9]~E(x91,x92)+E(f15(x91),f15(x92)) % 0.56/0.64 [10]~E(x101,x102)+E(f5(x101),f5(x102)) % 0.56/0.64 [11]~E(x111,x112)+E(f6(x111),f6(x112)) % 0.56/0.64 [12]~E(x121,x122)+E(f11(x121),f11(x122)) % 0.56/0.64 [13]~E(x131,x132)+E(f8(x131),f8(x132)) % 0.56/0.64 [14]~P1(x141)+P1(x142)+~E(x141,x142) % 0.56/0.64 [15]P16(x152,x153)+~E(x151,x152)+~P16(x151,x153) % 0.56/0.64 [16]P16(x163,x162)+~E(x161,x162)+~P16(x163,x161) % 0.56/0.64 [17]~P6(x171)+P6(x172)+~E(x171,x172) % 0.56/0.64 [18]P5(x182,x183)+~E(x181,x182)+~P5(x181,x183) % 0.56/0.64 [19]P5(x193,x192)+~E(x191,x192)+~P5(x193,x191) % 0.56/0.64 [20]~P9(x201)+P9(x202)+~E(x201,x202) % 0.56/0.64 [21]~P2(x211)+P2(x212)+~E(x211,x212) % 0.56/0.64 [22]~P4(x221)+P4(x222)+~E(x221,x222) % 0.56/0.64 [23]~P3(x231)+P3(x232)+~E(x231,x232) % 0.56/0.64 [24]P13(x242,x243)+~E(x241,x242)+~P13(x241,x243) % 0.56/0.64 [25]P13(x253,x252)+~E(x251,x252)+~P13(x253,x251) % 0.56/0.64 [26]~P12(x261)+P12(x262)+~E(x261,x262) % 0.56/0.64 [27]~P14(x271)+P14(x272)+~E(x271,x272) % 0.56/0.64 [28]~P8(x281)+P8(x282)+~E(x281,x282) % 0.56/0.64 [29]~P7(x291)+P7(x292)+~E(x291,x292) % 0.56/0.64 [30]~P11(x301)+P11(x302)+~E(x301,x302) % 0.56/0.64 [31]~P10(x311)+P10(x312)+~E(x311,x312) % 0.56/0.64 [32]~P15(x321)+P15(x322)+~E(x321,x322) % 0.56/0.64 % 0.56/0.64 %------------------------------------------- % 0.56/0.64 cnf(103,plain, % 0.56/0.64 (P13(x1031,f15(x1032))+~P6(x1031)+~P16(x1031,x1032)+~P9(f15(x1032))), % 0.56/0.64 inference(equality_inference,[],[95])). % 0.56/0.64 cnf(104,plain, % 0.56/0.64 (~P13(a7,f15(a4))), % 0.56/0.64 inference(scs_inference,[],[69,87])). % 0.56/0.64 cnf(106,plain, % 0.56/0.64 (P16(a7,a4)), % 0.56/0.64 inference(scs_inference,[],[59,69,87,93])). % 0.56/0.64 cnf(111,plain, % 0.56/0.64 (P5(f8(x1111),x1111)), % 0.56/0.64 inference(rename_variables,[],[60])). % 0.56/0.64 cnf(114,plain, % 0.56/0.64 (P5(f8(x1141),x1141)), % 0.56/0.64 inference(rename_variables,[],[60])). % 0.56/0.64 cnf(116,plain, % 0.56/0.64 (P6(a7)), % 0.56/0.64 inference(scs_inference,[],[36,59,69,60,111,33,63,87,93,81,86,88,91])). % 0.56/0.64 cnf(118,plain, % 0.56/0.64 (~P13(x1181,f8(f14(a1)))), % 0.56/0.64 inference(scs_inference,[],[36,59,69,60,111,114,33,63,87,93,81,86,88,91,96])). % 0.56/0.64 cnf(119,plain, % 0.56/0.64 (P5(f8(x1191),x1191)), % 0.56/0.64 inference(rename_variables,[],[60])). % 0.56/0.64 cnf(128,plain, % 0.56/0.64 (P13(a4,f15(a4))), % 0.56/0.64 inference(scs_inference,[],[36,59,69,58,60,111,114,119,61,33,63,46,87,93,81,86,88,91,96,97,18,19,25,103])). % 0.56/0.64 cnf(151,plain, % 0.56/0.64 (P5(f13(x1511),f14(x1511))), % 0.56/0.64 inference(rename_variables,[],[62])). % 0.56/0.64 cnf(154,plain, % 0.56/0.64 (P5(f13(x1541),f14(x1541))), % 0.56/0.64 inference(rename_variables,[],[62])). % 0.56/0.64 cnf(164,plain, % 0.56/0.64 ($false), % 0.56/0.64 inference(scs_inference,[],[36,69,118,128,104,106,116,62,151,154,34,64,60,46,92,93,81,91,96,88,97,25,103]), % 0.56/0.64 ['proof']). % 0.56/0.64 % SZS output end Proof % 0.56/0.64 % Total time :0.010000s %------------------------------------------------------------------------------