%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : CSR113+16 : 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 : n024.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:21 EDT 2022 % Result : Theorem 0.68s 0.59s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : CSR113+16 : TPTP v8.1.0. Released v4.0.0. % 0.12/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.33 % Computer : n024.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Sat Jun 11 08:00:49 EDT 2022 % 0.13/0.34 % CPUTime : % 0.68/0.59 % SZS status Theorem % 0.68/0.59 % SZS output begin IncompleteProof % 0.68/0.59 cnf(c0, axiom, % 0.68/0.59 ~val(X0,new_york_0) | ~subs(X1,stehen_1_1) | ~sub(X0,name_1_1) | ~scar(X1,X2) | ~loc(X1,X3) | ~attr(X4,X0)). % 0.68/0.59 cnf(c1, plain, % 0.68/0.59 ~val(X0,new_york_0) | ~subs(X1,stehen_1_1) | ~sub(X0,name_1_1) | ~scar(X1,X2) | ~loc(X1,X3) | ~attr(X4,X0), % 0.68/0.59 inference(start, [], [c0])). % 0.68/0.59 % 0.68/0.59 cnf(c2, axiom, % 0.68/0.59 val(c42,new_york_0)). % 0.68/0.59 cnf(a0, assumption, % 0.68/0.59 X0 = c42). % 0.68/0.59 cnf(a1, assumption, % 0.68/0.59 new_york_0 = new_york_0). % 0.68/0.59 cnf(c3, plain, % 0.68/0.59 ~subs(X1,stehen_1_1) | ~sub(X0,name_1_1) | ~scar(X1,X2) | ~loc(X1,X3) | ~attr(X4,X0), % 0.68/0.59 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.68/0.59 cnf(c4, plain, % 0.68/0.59 $false, % 0.68/0.59 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.68/0.59 % 0.68/0.59 cnf(c5, axiom, % 0.68/0.59 subs(sK111(X5,X6),stehen_1_1) | ~sP48(X5,X6)). % 0.68/0.59 cnf(a2, assumption, % 0.68/0.59 X1 = sK111(X5,X6)). % 0.68/0.59 cnf(a3, assumption, % 0.68/0.59 stehen_1_1 = stehen_1_1). % 0.68/0.59 cnf(c6, plain, % 0.68/0.59 ~sub(X0,name_1_1) | ~scar(X1,X2) | ~loc(X1,X3) | ~attr(X4,X0), % 0.68/0.59 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])). % 0.68/0.59 cnf(c7, plain, % 0.68/0.59 ~sP48(X5,X6), % 0.68/0.59 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])). % 0.68/0.59 % 0.68/0.59 cnf(c8, axiom, % 0.68/0.59 sP48(X7,X8) | ~loc(X7,X8)). % 0.68/0.59 cnf(a4, assumption, % 0.68/0.59 X5 = X7). % 0.68/0.59 cnf(a5, assumption, % 0.68/0.59 X6 = X8). % 0.68/0.59 cnf(c9, plain, % 0.68/0.59 $false, % 0.68/0.59 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.68/0.59 cnf(c10, plain, % 0.68/0.59 ~loc(X7,X8), % 0.68/0.59 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.68/0.59 % 0.68/0.59 cnf(c11, axiom, % 0.68/0.59 loc(c50171,c55271)). % 0.68/0.59 cnf(a6, assumption, % 0.68/0.59 X7 = c50171). % 0.68/0.59 cnf(a7, assumption, % 0.68/0.59 X8 = c55271). % 0.68/0.59 cnf(c12, plain, % 0.68/0.59 $false, % 0.68/0.59 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.68/0.59 cnf(c13, plain, % 0.68/0.59 $false, % 0.68/0.59 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.68/0.59 % 0.68/0.59 cnf(c14, axiom, % 0.68/0.59 sub(c42,name_1_1)). % 0.68/0.59 cnf(a8, assumption, % 0.68/0.59 X0 = c42). % 0.68/0.59 cnf(a9, assumption, % 0.68/0.59 name_1_1 = name_1_1). % 0.68/0.59 cnf(c15, plain, % 0.68/0.59 ~scar(X1,X2) | ~loc(X1,X3) | ~attr(X4,X0), % 0.68/0.59 inference(strict_predicate_extension, [assumptions([a8, a9])], [c6, c14])). % 0.68/0.59 cnf(c16, plain, % 0.68/0.59 $false, % 0.68/0.59 inference(strict_predicate_extension, [assumptions([a8, a9])], [c6, c14])). % 0.68/0.59 % 0.68/0.59 cnf(c17, axiom, % 0.68/0.59 scar(sK111(X9,X10),X9) | ~sP48(X9,X10)). % 0.68/0.59 cnf(a10, assumption, % 0.68/0.59 X1 = sK111(X9,X10)). % 0.68/0.59 cnf(a11, assumption, % 0.68/0.59 X2 = X9). % 0.68/0.59 cnf(c18, plain, % 0.68/0.59 ~loc(X1,X3) | ~attr(X4,X0), % 0.68/0.59 inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])). % 0.68/0.59 cnf(c19, plain, % 0.68/0.59 ~sP48(X9,X10), % 0.68/0.59 inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])). % 0.68/0.59 % 0.68/0.59 cnf(c20, plain, % 0.68/0.59 sP48(X5,X6)). % 0.68/0.59 cnf(a12, assumption, % 0.68/0.59 X9 = X5). % 0.68/0.59 cnf(a13, assumption, % 0.68/0.59 X10 = X6). % 0.68/0.59 cnf(c21, plain, % 0.68/0.59 $false, % 0.68/0.59 inference(predicate_reduction, [assumptions([a12, a13])], [c19, c20])). % 0.68/0.59 % 0.68/0.59 cnf(c22, axiom, % 0.68/0.59 loc(sK111(X11,X12),X12) | ~sP48(X11,X12)). % 0.68/0.59 cnf(a14, assumption, % 0.68/0.59 X1 = sK111(X11,X12)). % 0.68/0.59 cnf(a15, assumption, % 0.68/0.59 X3 = X12). % 0.68/0.59 cnf(c23, plain, % 0.68/0.59 ~attr(X4,X0), % 0.68/0.59 inference(strict_predicate_extension, [assumptions([a14, a15])], [c18, c22])). % 0.68/0.59 cnf(c24, plain, % 0.68/0.59 ~sP48(X11,X12), % 0.68/0.59 inference(strict_predicate_extension, [assumptions([a14, a15])], [c18, c22])). % 0.68/0.59 % 0.68/0.59 cnf(c25, plain, % 0.68/0.59 sP48(X5,X6)). % 0.68/0.59 cnf(a16, assumption, % 0.68/0.59 X11 = X5). % 0.68/0.59 cnf(a17, assumption, % 0.68/0.59 X12 = X6). % 0.68/0.59 cnf(c26, plain, % 0.68/0.59 $false, % 0.68/0.59 inference(predicate_reduction, [assumptions([a16, a17])], [c24, c25])). % 0.68/0.59 % 0.68/0.59 cnf(c27, axiom, % 0.68/0.59 attr(c41,c42)). % 0.68/0.59 cnf(a18, assumption, % 0.68/0.59 X4 = c41). % 0.68/0.59 cnf(a19, assumption, % 0.68/0.59 X0 = c42). % 0.68/0.59 cnf(c28, plain, % 0.68/0.59 $false, % 0.68/0.59 inference(strict_predicate_extension, [assumptions([a18, a19])], [c23, c27])). % 0.68/0.59 cnf(c29, plain, % 0.68/0.59 $false, % 0.68/0.59 inference(strict_predicate_extension, [assumptions([a18, a19])], [c23, c27])). % 0.68/0.59 % 0.68/0.59 cnf(c30, plain, % 0.68/0.59 $false, % 0.68/0.59 inference(constraint_solving, [ % 0.68/0.59 bind(X0, c42), % 0.68/0.59 bind(X1, sK111(X5,X6)), % 0.68/0.59 bind(X2, c50171), % 0.68/0.59 bind(X3, c55271), % 0.68/0.59 bind(X4, c41), % 0.68/0.59 bind(X5, c50171), % 0.68/0.59 bind(X6, c55271), % 0.68/0.59 bind(X7, c50171), % 0.68/0.59 bind(X8, c55271), % 0.68/0.59 bind(X9, c50171), % 0.68/0.59 bind(X10, c55271), % 0.68/0.59 bind(X11, c50171), % 0.68/0.59 bind(X12, c55271) % 0.68/0.59 ], % 0.68/0.59 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19])). % 0.68/0.59 % 0.68/0.59 % SZS output end IncompleteProof %------------------------------------------------------------------------------