%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWV151+1 : TPTP v8.1.0. Bugfixed v3.3.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n009.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 : Wed Jul 20 19:45:41 EDT 2022 % Result : Theorem 2.42s 0.71s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWV151+1 : TPTP v8.1.0. Bugfixed v3.3.0. % 0.12/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.34 % Computer : n009.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Wed Jun 15 10:49:53 EDT 2022 % 0.12/0.34 % CPUTime : % 2.42/0.71 % SZS status Theorem % 2.42/0.71 % SZS output begin IncompleteProof % 2.42/0.71 cnf(c0, axiom, % 2.42/0.71 leq(sK41,tptp_minus_1)). % 2.42/0.71 cnf(c1, plain, % 2.42/0.71 leq(sK41,tptp_minus_1), % 2.42/0.71 inference(start, [], [c0])). % 2.42/0.71 % 2.42/0.71 cnf(c2, axiom, % 2.42/0.71 leq(X0,X1) | ~leq(X2,X1) | ~leq(X0,X2)). % 2.42/0.71 cnf(a0, assumption, % 2.42/0.71 sK41 = X2). % 2.42/0.71 cnf(a1, assumption, % 2.42/0.71 tptp_minus_1 = X1). % 2.42/0.71 cnf(c3, plain, % 2.42/0.71 $false, % 2.42/0.71 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 2.42/0.71 cnf(c4, plain, % 2.42/0.71 leq(X0,X1) | ~leq(X0,X2), % 2.42/0.71 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 2.42/0.71 % 2.42/0.71 cnf(c5, axiom, % 2.42/0.71 gt(plus(X3,n1),X4) | ~leq(X4,X3)). % 2.42/0.71 cnf(a2, assumption, % 2.42/0.71 X0 = X4). % 2.42/0.71 cnf(a3, assumption, % 2.42/0.71 X1 = X3). % 2.42/0.71 cnf(c6, plain, % 2.42/0.71 ~leq(X0,X2), % 2.42/0.71 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 2.42/0.71 cnf(c7, plain, % 2.42/0.71 gt(plus(X3,n1),X4), % 2.42/0.71 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 2.42/0.71 % 2.42/0.71 cnf(c8, axiom, % 2.42/0.71 n0 = plus(tptp_minus_1,n1)). % 2.42/0.71 cnf(a4, assumption, % 2.42/0.71 plus(X3,n1) = plus(tptp_minus_1,n1)). % 2.42/0.71 cnf(c9, plain, % 2.42/0.71 $false, % 2.42/0.71 inference(strict_function_extension, [assumptions([a4])], [c7, c8])). % 2.42/0.71 cnf(c10, plain, % 2.42/0.71 $false, % 2.42/0.71 inference(strict_function_extension, [assumptions([a4])], [c7, c8])). % 2.42/0.71 cnf(c11, plain, % 2.42/0.71 X5 != n0 | gt(X5,X4), % 2.42/0.71 inference(strict_function_extension, [assumptions([a4])], [c7, c8])). % 2.42/0.71 % 2.42/0.71 cnf(a5, assumption, % 2.42/0.71 X5 = n0). % 2.42/0.71 cnf(c12, plain, % 2.42/0.71 gt(X5,X4), % 2.42/0.71 inference(reflexivity, [assumptions([a5])], [c11])). % 2.42/0.71 % 2.42/0.71 cnf(c13, axiom, % 2.42/0.71 ~gt(X6,X6)). % 2.42/0.71 cnf(a6, assumption, % 2.42/0.71 X5 = X6). % 2.42/0.71 cnf(a7, assumption, % 2.42/0.71 X4 = X6). % 2.42/0.71 cnf(c14, plain, % 2.42/0.71 $false, % 2.42/0.71 inference(strict_predicate_extension, [assumptions([a6, a7])], [c12, c13])). % 2.42/0.71 cnf(c15, plain, % 2.42/0.71 $false, % 2.42/0.71 inference(strict_predicate_extension, [assumptions([a6, a7])], [c12, c13])). % 2.42/0.71 % 2.42/0.71 cnf(c16, axiom, % 2.42/0.71 leq(n0,sK41)). % 2.42/0.71 cnf(a8, assumption, % 2.42/0.71 X0 = n0). % 2.42/0.71 cnf(a9, assumption, % 2.42/0.71 X2 = sK41). % 2.42/0.71 cnf(c17, plain, % 2.42/0.71 $false, % 2.42/0.71 inference(strict_predicate_extension, [assumptions([a8, a9])], [c6, c16])). % 2.42/0.71 cnf(c18, plain, % 2.42/0.71 $false, % 2.42/0.71 inference(strict_predicate_extension, [assumptions([a8, a9])], [c6, c16])). % 2.42/0.71 % 2.42/0.71 cnf(c19, plain, % 2.42/0.71 $false, % 2.42/0.71 inference(constraint_solving, [ % 2.42/0.71 bind(X0, n0), % 2.42/0.71 bind(X1, tptp_minus_1), % 2.42/0.71 bind(X2, sK41), % 2.42/0.71 bind(X3, tptp_minus_1), % 2.42/0.71 bind(X4, n0), % 2.42/0.71 bind(X5, n0), % 2.42/0.71 bind(X6, n0) % 2.42/0.71 ], % 2.42/0.71 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])). % 2.42/0.71 % 2.42/0.71 % SZS output end IncompleteProof %------------------------------------------------------------------------------