%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : CSR115+59 : TPTP v8.1.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n018.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 : 600s % DateTime : Fri Jul 15 20:37:41 EDT 2022 % Result : Theorem 3.58s 0.99s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : CSR115+59 : TPTP v8.1.0. Released v4.0.0. % 0.03/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.35 % Computer : n018.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 : 600 % 0.14/0.35 % DateTime : Sat Jun 11 04:08:25 EDT 2022 % 0.14/0.35 % CPUTime : % 3.58/0.99 % SZS status Theorem % 3.58/0.99 % SZS output begin IncompleteProof % 3.58/0.99 cnf(c0, axiom, % 3.58/0.99 ~subs(X0,n374bernehmen_1_1) | ~sub(X1,name_1_1) | ~prop(X2,britisch__1_1) | ~obj(X0,X2) | ~attr(X3,X4) | ~attr(X5,X1)). % 3.58/0.99 cnf(c1, plain, % 3.58/0.99 ~subs(X0,n374bernehmen_1_1) | ~sub(X1,name_1_1) | ~prop(X2,britisch__1_1) | ~obj(X0,X2) | ~attr(X3,X4) | ~attr(X5,X1), % 3.58/0.99 inference(start, [], [c0])). % 3.58/0.99 % 3.58/0.99 cnf(c2, axiom, % 3.58/0.99 subs(sK53(X6,X7),X7) | ~subs(X6,X8) | ~chea(X7,X8)). % 3.58/0.99 cnf(a0, assumption, % 3.58/0.99 X0 = sK53(X6,X7)). % 3.58/0.99 cnf(a1, assumption, % 3.58/0.99 n374bernehmen_1_1 = X7). % 3.58/0.99 cnf(c3, plain, % 3.58/0.99 ~sub(X1,name_1_1) | ~prop(X2,britisch__1_1) | ~obj(X0,X2) | ~attr(X3,X4) | ~attr(X5,X1), % 3.58/0.99 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 3.58/0.99 cnf(c4, plain, % 3.58/0.99 ~subs(X6,X8) | ~chea(X7,X8), % 3.58/0.99 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 3.58/0.99 % 3.58/0.99 cnf(c5, axiom, % 3.58/0.99 subs(c113,annahme_1_1)). % 3.58/0.99 cnf(a2, assumption, % 3.58/0.99 X6 = c113). % 3.58/0.99 cnf(a3, assumption, % 3.58/0.99 X8 = annahme_1_1). % 3.58/0.99 cnf(c6, plain, % 3.58/0.99 ~chea(X7,X8), % 3.58/0.99 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 3.58/0.99 cnf(c7, plain, % 3.58/0.99 $false, % 3.58/0.99 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 3.58/0.99 % 3.58/0.99 cnf(c8, axiom, % 3.58/0.99 chea(n374bernehmen_1_1,annahme_1_1)). % 3.58/0.99 cnf(a4, assumption, % 3.58/0.99 X7 = n374bernehmen_1_1). % 3.58/0.99 cnf(a5, assumption, % 3.58/0.99 X8 = annahme_1_1). % 3.58/0.99 cnf(c9, plain, % 3.58/0.99 $false, % 3.58/0.99 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 3.58/0.99 cnf(c10, plain, % 3.58/0.99 $false, % 3.58/0.99 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 3.58/0.99 % 3.58/0.99 cnf(c11, axiom, % 3.58/0.99 sub(c104,name_1_1)). % 3.58/0.99 cnf(a6, assumption, % 3.58/0.99 X1 = c104). % 3.58/0.99 cnf(a7, assumption, % 3.58/0.99 name_1_1 = name_1_1). % 3.58/0.99 cnf(c12, plain, % 3.58/0.99 ~prop(X2,britisch__1_1) | ~obj(X0,X2) | ~attr(X3,X4) | ~attr(X5,X1), % 3.58/0.99 inference(strict_predicate_extension, [assumptions([a6, a7])], [c3, c11])). % 3.58/0.99 cnf(c13, plain, % 3.58/0.99 $false, % 3.58/0.99 inference(strict_predicate_extension, [assumptions([a6, a7])], [c3, c11])). % 3.58/0.99 % 3.58/0.99 cnf(c14, axiom, % 3.58/0.99 prop(c117,britisch__1_1)). % 3.58/0.99 cnf(a8, assumption, % 3.58/0.99 X2 = c117). % 3.58/0.99 cnf(a9, assumption, % 3.58/0.99 britisch__1_1 = britisch__1_1). % 3.58/0.99 cnf(c15, plain, % 3.58/0.99 ~obj(X0,X2) | ~attr(X3,X4) | ~attr(X5,X1), % 3.58/0.99 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])). % 3.58/0.99 cnf(c16, plain, % 3.58/0.99 $false, % 3.58/0.99 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])). % 3.58/0.99 % 3.58/0.99 cnf(c17, axiom, % 3.58/0.99 obj(X9,X10) | ~obj(X11,X10) | ~chea(X9,X11)). % 3.58/0.99 cnf(a10, assumption, % 3.58/0.99 X0 = X9). % 3.58/0.99 cnf(a11, assumption, % 3.58/0.99 X2 = X10). % 3.58/0.99 cnf(c18, plain, % 3.58/0.99 ~attr(X3,X4) | ~attr(X5,X1), % 3.58/0.99 inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])). % 3.58/0.99 cnf(c19, plain, % 3.58/0.99 ~obj(X11,X10) | ~chea(X9,X11), % 3.58/0.99 inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])). % 3.58/0.99 % 3.58/0.99 cnf(c20, axiom, % 3.58/0.99 obj(c113,c117)). % 3.58/0.99 cnf(a12, assumption, % 3.58/0.99 X11 = c113). % 3.58/0.99 cnf(a13, assumption, % 3.58/0.99 X10 = c117). % 3.58/0.99 cnf(c21, plain, % 3.58/0.99 ~chea(X9,X11), % 3.58/0.99 inference(strict_predicate_extension, [assumptions([a12, a13])], [c19, c20])). % 3.58/0.99 cnf(c22, plain, % 3.58/0.99 $false, % 3.58/0.99 inference(strict_predicate_extension, [assumptions([a12, a13])], [c19, c20])). % 3.58/0.99 % 3.58/0.99 cnf(c23, axiom, % 3.58/0.99 chea(sK53(X12,X13),X12) | ~subs(X12,X14) | ~chea(X13,X14)). % 3.58/0.99 cnf(a14, assumption, % 3.58/0.99 X9 = sK53(X12,X13)). % 3.58/0.99 cnf(a15, assumption, % 3.58/0.99 X11 = X12). % 3.58/0.99 cnf(c24, plain, % 3.58/0.99 $false, % 3.58/0.99 inference(strict_predicate_extension, [assumptions([a14, a15])], [c21, c23])). % 3.58/0.99 cnf(c25, plain, % 3.58/0.99 ~subs(X12,X14) | ~chea(X13,X14), % 3.58/0.99 inference(strict_predicate_extension, [assumptions([a14, a15])], [c21, c23])). % 3.58/0.99 % 3.58/0.99 cnf(c26, plain, % 3.58/0.99 subs(X6,X8)). % 3.58/0.99 cnf(a16, assumption, % 3.58/0.99 X12 = X6). % 3.58/0.99 cnf(a17, assumption, % 3.58/0.99 X14 = X8). % 3.58/0.99 cnf(c27, plain, % 3.58/0.99 ~chea(X13,X14), % 3.58/0.99 inference(predicate_reduction, [assumptions([a16, a17])], [c25, c26])). % 3.58/0.99 % 3.58/0.99 cnf(c28, plain, % 3.58/0.99 chea(X7,X8)). % 3.58/0.99 cnf(a18, assumption, % 3.58/0.99 X13 = X7). % 3.58/0.99 cnf(a19, assumption, % 3.58/0.99 X14 = X8). % 3.58/0.99 cnf(c29, plain, % 3.58/0.99 $false, % 3.58/0.99 inference(predicate_reduction, [assumptions([a18, a19])], [c27, c28])). % 3.58/0.99 % 3.58/0.99 cnf(c30, axiom, % 3.58/0.99 attr(c103,c104)). % 3.58/0.99 cnf(a20, assumption, % 3.58/0.99 X3 = c103). % 3.58/0.99 cnf(a21, assumption, % 3.58/0.99 X4 = c104). % 3.58/0.99 cnf(c31, plain, % 3.58/0.99 ~attr(X5,X1), % 3.58/0.99 inference(strict_predicate_extension, [assumptions([a20, a21])], [c18, c30])). % 3.58/0.99 cnf(c32, plain, % 3.58/0.99 $false, % 3.58/0.99 inference(strict_predicate_extension, [assumptions([a20, a21])], [c18, c30])). % 3.58/0.99 % 3.58/0.99 cnf(c33, plain, % 3.58/0.99 attr(X3,X4)). % 3.58/0.99 cnf(a22, assumption, % 3.58/0.99 X5 = X3). % 3.58/0.99 cnf(a23, assumption, % 3.58/0.99 X1 = X4). % 3.58/0.99 cnf(c34, plain, % 3.58/0.99 $false, % 3.58/0.99 inference(predicate_reduction, [assumptions([a22, a23])], [c31, c33])). % 3.58/0.99 % 3.58/0.99 cnf(c35, plain, % 3.58/0.99 $false, % 3.58/0.99 inference(constraint_solving, [ % 3.58/0.99 bind(X0, sK53(X6,X7)), % 3.58/0.99 bind(X1, c104), % 3.58/0.99 bind(X2, c117), % 3.58/0.99 bind(X3, c103), % 3.58/0.99 bind(X4, c104), % 3.58/0.99 bind(X5, c103), % 3.58/0.99 bind(X6, c113), % 3.58/0.99 bind(X7, n374bernehmen_1_1), % 3.58/0.99 bind(X8, annahme_1_1), % 3.58/0.99 bind(X9, sK53(X6,X7)), % 3.58/0.99 bind(X10, c117), % 3.58/0.99 bind(X11, c113), % 3.58/0.99 bind(X12, c113), % 3.58/0.99 bind(X13, n374bernehmen_1_1), % 3.58/0.99 bind(X14, annahme_1_1) % 3.58/0.99 ], % 3.58/0.99 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23])). % 3.58/0.99 % 3.58/0.99 % SZS output end IncompleteProof %------------------------------------------------------------------------------