%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWV041+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 : n017.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:22 EDT 2022 % Result : Theorem 0.23s 0.44s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.14 % Problem : SWV041+1 : TPTP v8.1.0. Bugfixed v3.3.0. % 0.07/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.36 % Computer : n017.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Wed Jun 15 18:01:40 EDT 2022 % 0.14/0.36 % CPUTime : % 0.23/0.44 % SZS status Theorem % 0.23/0.44 % SZS output begin IncompleteProof % 0.23/0.44 cnf(c0, axiom, % 0.23/0.44 leq(n0,sK42)). % 0.23/0.44 cnf(c1, plain, % 0.23/0.44 leq(n0,sK42), % 0.23/0.44 inference(start, [], [c0])). % 0.23/0.44 % 0.23/0.44 cnf(c2, axiom, % 0.23/0.44 leq(X0,X1) | ~leq(X2,X1) | ~leq(X0,X2)). % 0.23/0.44 cnf(a0, assumption, % 0.23/0.44 n0 = X0). % 0.23/0.44 cnf(a1, assumption, % 0.23/0.44 sK42 = X2). % 0.23/0.44 cnf(c3, plain, % 0.23/0.44 $false, % 0.23/0.44 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.23/0.44 cnf(c4, plain, % 0.23/0.44 leq(X0,X1) | ~leq(X2,X1), % 0.23/0.44 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.23/0.44 % 0.23/0.44 cnf(c5, axiom, % 0.23/0.44 gt(X3,X4) | ~leq(X4,minus(X3,n1))). % 0.23/0.44 cnf(a2, assumption, % 0.23/0.44 X0 = X4). % 0.23/0.44 cnf(a3, assumption, % 0.23/0.44 X1 = minus(X3,n1)). % 0.23/0.44 cnf(c6, plain, % 0.23/0.44 ~leq(X2,X1), % 0.23/0.44 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.23/0.44 cnf(c7, plain, % 0.23/0.44 gt(X3,X4), % 0.23/0.44 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.23/0.44 % 0.23/0.44 cnf(c8, axiom, % 0.23/0.44 ~gt(X5,X5)). % 0.23/0.44 cnf(a4, assumption, % 0.23/0.44 X3 = X5). % 0.23/0.44 cnf(a5, assumption, % 0.23/0.44 X4 = X5). % 0.23/0.44 cnf(c9, plain, % 0.23/0.44 $false, % 0.23/0.44 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.23/0.44 cnf(c10, plain, % 0.23/0.44 $false, % 0.23/0.44 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.23/0.44 % 0.23/0.44 cnf(c11, axiom, % 0.23/0.44 leq(sK42,minus(n0,n1))). % 0.23/0.44 cnf(a6, assumption, % 0.23/0.44 X2 = sK42). % 0.23/0.44 cnf(a7, assumption, % 0.23/0.44 X1 = minus(n0,n1)). % 0.23/0.44 cnf(c12, plain, % 0.23/0.44 $false, % 0.23/0.44 inference(strict_predicate_extension, [assumptions([a6, a7])], [c6, c11])). % 0.23/0.44 cnf(c13, plain, % 0.23/0.44 $false, % 0.23/0.44 inference(strict_predicate_extension, [assumptions([a6, a7])], [c6, c11])). % 0.23/0.44 % 0.23/0.44 cnf(c14, plain, % 0.23/0.44 $false, % 0.23/0.44 inference(constraint_solving, [ % 0.23/0.44 bind(X0, n0), % 0.23/0.44 bind(X1, minus(X3,n1)), % 0.23/0.44 bind(X2, sK42), % 0.23/0.44 bind(X3, n0), % 0.23/0.44 bind(X4, n0), % 0.23/0.44 bind(X5, n0) % 0.23/0.44 ], % 0.23/0.44 [a0, a1, a2, a3, a4, a5, a6, a7])). % 0.23/0.44 % 0.23/0.44 % SZS output end IncompleteProof %------------------------------------------------------------------------------