%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : CSR115+21 : 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 : n025.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:33 EDT 2022 % Result : Theorem 0.19s 0.53s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : CSR115+21 : TPTP v8.1.0. Released v4.0.0. % 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n025.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 : 600 % 0.12/0.33 % DateTime : Sat Jun 11 07:56:07 EDT 2022 % 0.12/0.33 % CPUTime : % 0.19/0.53 % SZS status Theorem % 0.19/0.53 % SZS output begin IncompleteProof % 0.19/0.53 cnf(c0, axiom, % 0.19/0.53 ~val(X0,bmw_0) | ~val(X1,bmw_0) | ~sub(X0,name_1_1) | ~sub(X1,name_1_1) | ~attr(X2,X3) | ~attr(X4,X0) | ~attr(X5,X1) | ~agt(X6,X4)). % 0.19/0.53 cnf(c1, plain, % 0.19/0.53 ~val(X0,bmw_0) | ~val(X1,bmw_0) | ~sub(X0,name_1_1) | ~sub(X1,name_1_1) | ~attr(X2,X3) | ~attr(X4,X0) | ~attr(X5,X1) | ~agt(X6,X4), % 0.19/0.53 inference(start, [], [c0])). % 0.19/0.53 % 0.19/0.53 cnf(c2, axiom, % 0.19/0.53 val(c718,bmw_0)). % 0.19/0.53 cnf(a0, assumption, % 0.19/0.53 X0 = c718). % 0.19/0.53 cnf(a1, assumption, % 0.19/0.53 bmw_0 = bmw_0). % 0.19/0.53 cnf(c3, plain, % 0.19/0.53 ~val(X1,bmw_0) | ~sub(X0,name_1_1) | ~sub(X1,name_1_1) | ~attr(X2,X3) | ~attr(X4,X0) | ~attr(X5,X1) | ~agt(X6,X4), % 0.19/0.53 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.19/0.53 cnf(c4, plain, % 0.19/0.53 $false, % 0.19/0.53 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.19/0.53 % 0.19/0.53 cnf(c5, plain, % 0.19/0.53 val(X0,bmw_0)). % 0.19/0.53 cnf(a2, assumption, % 0.19/0.53 X1 = X0). % 0.19/0.53 cnf(a3, assumption, % 0.19/0.53 bmw_0 = bmw_0). % 0.19/0.53 cnf(c6, plain, % 0.19/0.53 ~sub(X0,name_1_1) | ~sub(X1,name_1_1) | ~attr(X2,X3) | ~attr(X4,X0) | ~attr(X5,X1) | ~agt(X6,X4), % 0.19/0.53 inference(predicate_reduction, [assumptions([a2, a3])], [c3, c5])). % 0.19/0.53 % 0.19/0.53 cnf(c7, axiom, % 0.19/0.53 sub(c718,name_1_1)). % 0.19/0.53 cnf(a4, assumption, % 0.19/0.53 X0 = c718). % 0.19/0.53 cnf(a5, assumption, % 0.19/0.53 name_1_1 = name_1_1). % 0.19/0.53 cnf(c8, plain, % 0.19/0.53 ~sub(X1,name_1_1) | ~attr(X2,X3) | ~attr(X4,X0) | ~attr(X5,X1) | ~agt(X6,X4), % 0.19/0.53 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c7])). % 0.19/0.53 cnf(c9, plain, % 0.19/0.53 $false, % 0.19/0.53 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c7])). % 0.19/0.53 % 0.19/0.53 cnf(c10, plain, % 0.19/0.53 sub(X0,name_1_1)). % 0.19/0.53 cnf(a6, assumption, % 0.19/0.53 X1 = X0). % 0.19/0.53 cnf(a7, assumption, % 0.19/0.53 name_1_1 = name_1_1). % 0.19/0.53 cnf(c11, plain, % 0.19/0.53 ~attr(X2,X3) | ~attr(X4,X0) | ~attr(X5,X1) | ~agt(X6,X4), % 0.19/0.53 inference(predicate_reduction, [assumptions([a6, a7])], [c8, c10])). % 0.19/0.53 % 0.19/0.53 cnf(c12, axiom, % 0.19/0.53 attr(c5,c802)). % 0.19/0.53 cnf(a8, assumption, % 0.19/0.53 X2 = c5). % 0.19/0.53 cnf(a9, assumption, % 0.19/0.53 X3 = c802). % 0.19/0.53 cnf(c13, plain, % 0.19/0.53 ~attr(X4,X0) | ~attr(X5,X1) | ~agt(X6,X4), % 0.19/0.53 inference(strict_predicate_extension, [assumptions([a8, a9])], [c11, c12])). % 0.19/0.53 cnf(c14, plain, % 0.19/0.53 $false, % 0.19/0.53 inference(strict_predicate_extension, [assumptions([a8, a9])], [c11, c12])). % 0.19/0.54 % 0.19/0.54 cnf(c15, axiom, % 0.19/0.54 attr(c717,c718)). % 0.19/0.54 cnf(a10, assumption, % 0.19/0.54 X4 = c717). % 0.19/0.54 cnf(a11, assumption, % 0.19/0.54 X0 = c718). % 0.19/0.54 cnf(c16, plain, % 0.19/0.54 ~attr(X5,X1) | ~agt(X6,X4), % 0.19/0.54 inference(strict_predicate_extension, [assumptions([a10, a11])], [c13, c15])). % 0.19/0.54 cnf(c17, plain, % 0.19/0.54 $false, % 0.19/0.54 inference(strict_predicate_extension, [assumptions([a10, a11])], [c13, c15])). % 0.19/0.54 % 0.19/0.54 cnf(c18, plain, % 0.19/0.54 attr(X4,X0)). % 0.19/0.54 cnf(a12, assumption, % 0.19/0.54 X5 = X4). % 0.19/0.54 cnf(a13, assumption, % 0.19/0.54 X1 = X0). % 0.19/0.54 cnf(c19, plain, % 0.19/0.54 ~agt(X6,X4), % 0.19/0.54 inference(predicate_reduction, [assumptions([a12, a13])], [c16, c18])). % 0.19/0.54 % 0.19/0.54 cnf(c20, axiom, % 0.19/0.54 agt(c816,c717)). % 0.19/0.54 cnf(a14, assumption, % 0.19/0.54 X6 = c816). % 0.19/0.54 cnf(a15, assumption, % 0.19/0.54 X4 = c717). % 0.19/0.54 cnf(c21, plain, % 0.19/0.54 $false, % 0.19/0.54 inference(strict_predicate_extension, [assumptions([a14, a15])], [c19, c20])). % 0.19/0.54 cnf(c22, plain, % 0.19/0.54 $false, % 0.19/0.54 inference(strict_predicate_extension, [assumptions([a14, a15])], [c19, c20])). % 0.19/0.54 % 0.19/0.54 cnf(c23, plain, % 0.19/0.54 $false, % 0.19/0.54 inference(constraint_solving, [ % 0.19/0.54 bind(X0, c718), % 0.19/0.54 bind(X1, c718), % 0.19/0.54 bind(X2, c5), % 0.19/0.54 bind(X3, c802), % 0.19/0.54 bind(X4, c717), % 0.19/0.54 bind(X5, c717), % 0.19/0.54 bind(X6, c816) % 0.19/0.54 ], % 0.19/0.54 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])). % 0.19/0.54 % 0.19/0.54 % SZS output end IncompleteProof %------------------------------------------------------------------------------