%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWV221+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 : 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 : Wed Jul 20 19:45:54 EDT 2022 % Result : Theorem 29.16s 4.19s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.14 % Problem : SWV221+1 : TPTP v8.1.0. Bugfixed v3.3.0. % 0.04/0.15 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.16/0.37 % Computer : n018.cluster.edu % 0.16/0.37 % Model : x86_64 x86_64 % 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.37 % Memory : 8042.1875MB % 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.37 % CPULimit : 300 % 0.16/0.37 % WCLimit : 600 % 0.16/0.37 % DateTime : Wed Jun 15 16:52:15 EDT 2022 % 0.16/0.37 % CPUTime : % 29.16/4.19 % SZS status Theorem % 29.16/4.19 % SZS output begin IncompleteProof % 29.16/4.19 cnf(c0, axiom, % 29.16/4.19 leq(sK41,minus(pv57,n1))). % 29.16/4.19 cnf(c1, plain, % 29.16/4.19 leq(sK41,minus(pv57,n1)), % 29.16/4.19 inference(start, [], [c0])). % 29.16/4.19 % 29.16/4.19 cnf(c2, axiom, % 29.16/4.19 a_select3(id_ds1_filter,X0,X1) = a_select3(id_ds1_filter,X1,X0) | ~leq(X1,n5) | ~leq(n0,X1) | ~leq(X0,minus(pv57,n1)) | ~leq(n0,X0)). % 29.16/4.19 cnf(a0, assumption, % 29.16/4.19 sK41 = X0). % 29.16/4.19 cnf(a1, assumption, % 29.16/4.19 minus(pv57,n1) = minus(pv57,n1)). % 29.16/4.19 cnf(c3, plain, % 29.16/4.19 $false, % 29.16/4.19 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 29.16/4.19 cnf(c4, plain, % 29.16/4.19 a_select3(id_ds1_filter,X0,X1) = a_select3(id_ds1_filter,X1,X0) | ~leq(X1,n5) | ~leq(n0,X1) | ~leq(n0,X0), % 29.16/4.19 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 29.16/4.19 % 29.16/4.19 cnf(c5, axiom, % 29.16/4.19 a_select3(id_ds1_filter,sK41,sK42) != a_select3(id_ds1_filter,sK42,sK41)). % 29.16/4.19 cnf(a2, assumption, % 29.16/4.19 a_select3(id_ds1_filter,sK42,sK41) = a_select3(id_ds1_filter,X1,X0)). % 29.16/4.19 cnf(a3, assumption, % 29.16/4.19 a_select3(id_ds1_filter,X0,X1) = X2). % 29.16/4.19 cnf(c6, plain, % 29.16/4.19 ~leq(X1,n5) | ~leq(n0,X1) | ~leq(n0,X0), % 29.16/4.19 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])). % 29.16/4.19 cnf(c7, plain, % 29.16/4.19 $false, % 29.16/4.19 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])). % 29.16/4.19 cnf(c8, plain, % 29.16/4.19 a_select3(id_ds1_filter,sK41,sK42) != X2, % 29.16/4.19 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])). % 29.16/4.19 % 29.16/4.19 cnf(a4, assumption, % 29.16/4.19 a_select3(id_ds1_filter,sK41,sK42) = X2). % 29.16/4.19 cnf(c9, plain, % 29.16/4.19 $false, % 29.16/4.19 inference(reflexivity, [assumptions([a4])], [c8])). % 29.16/4.19 % 29.16/4.19 cnf(c10, axiom, % 29.16/4.19 leq(sK42,n5)). % 29.16/4.19 cnf(a5, assumption, % 29.16/4.19 X1 = sK42). % 29.16/4.19 cnf(a6, assumption, % 29.16/4.19 n5 = n5). % 29.16/4.19 cnf(c11, plain, % 29.16/4.19 ~leq(n0,X1) | ~leq(n0,X0), % 29.16/4.19 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c10])). % 29.16/4.19 cnf(c12, plain, % 29.16/4.19 $false, % 29.16/4.19 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c10])). % 29.16/4.19 % 29.16/4.19 cnf(c13, axiom, % 29.16/4.19 leq(n0,sK42)). % 29.16/4.19 cnf(a7, assumption, % 29.16/4.19 n0 = n0). % 29.16/4.19 cnf(a8, assumption, % 29.16/4.19 X1 = sK42). % 29.16/4.19 cnf(c14, plain, % 29.16/4.19 ~leq(n0,X0), % 29.16/4.19 inference(strict_predicate_extension, [assumptions([a7, a8])], [c11, c13])). % 29.16/4.19 cnf(c15, plain, % 29.16/4.19 $false, % 29.16/4.19 inference(strict_predicate_extension, [assumptions([a7, a8])], [c11, c13])). % 29.16/4.19 % 29.16/4.19 cnf(c16, axiom, % 29.16/4.19 leq(n0,sK41)). % 29.16/4.19 cnf(a9, assumption, % 29.16/4.19 n0 = n0). % 29.16/4.19 cnf(a10, assumption, % 29.16/4.19 X0 = sK41). % 29.16/4.19 cnf(c17, plain, % 29.16/4.19 $false, % 29.16/4.19 inference(strict_predicate_extension, [assumptions([a9, a10])], [c14, c16])). % 29.16/4.19 cnf(c18, plain, % 29.16/4.19 $false, % 29.16/4.19 inference(strict_predicate_extension, [assumptions([a9, a10])], [c14, c16])). % 29.16/4.19 % 29.16/4.19 cnf(c19, plain, % 29.16/4.19 $false, % 29.16/4.19 inference(constraint_solving, [ % 29.16/4.19 bind(X0, sK41), % 29.16/4.19 bind(X1, sK42), % 29.16/4.19 bind(X2, a_select3(id_ds1_filter,X0,X1)) % 29.16/4.19 ], % 29.16/4.19 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])). % 29.16/4.19 % 29.16/4.19 % SZS output end IncompleteProof %------------------------------------------------------------------------------