%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWV373+1 : TPTP v8.1.0. Released 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 : n016.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:46:42 EDT 2022 % Result : Theorem 31.85s 4.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWV373+1 : TPTP v8.1.0. Released v3.3.0. % 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.34 % Computer : n016.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Wed Jun 15 11:05:32 EDT 2022 % 0.13/0.34 % CPUTime : % 31.85/4.37 % SZS status Theorem % 31.85/4.37 % SZS output begin IncompleteProof % 31.85/4.37 cnf(c0, axiom, % 31.85/4.37 ok(findmin_cpq_eff(triple(sK2,sK3,sK4)))). % 31.85/4.37 cnf(c1, plain, % 31.85/4.37 ok(findmin_cpq_eff(triple(sK2,sK3,sK4))), % 31.85/4.37 inference(start, [], [c0])). % 31.85/4.37 % 31.85/4.37 cnf(c2, axiom, % 31.85/4.37 findmin_pqp_res(X0) = removemin_cpq_res(triple(X0,X1,X2)) | create_slb = X1). % 31.85/4.37 cnf(a0, assumption, % 31.85/4.37 sK3 = X1). % 31.85/4.37 cnf(c3, plain, % 31.85/4.37 $false, % 31.85/4.37 inference(variable_extension, [assumptions([a0])], [c1, c2])). % 31.85/4.37 cnf(c4, plain, % 31.85/4.37 findmin_pqp_res(X0) = removemin_cpq_res(triple(X0,X1,X2)), % 31.85/4.37 inference(variable_extension, [assumptions([a0])], [c1, c2])). % 31.85/4.37 cnf(c5, plain, % 31.85/4.37 create_slb != X3 | ok(findmin_cpq_eff(triple(sK2,X3,sK4))), % 31.85/4.37 inference(variable_extension, [assumptions([a0])], [c1, c2])). % 31.85/4.37 % 31.85/4.37 cnf(a1, assumption, % 31.85/4.37 create_slb = X3). % 31.85/4.37 cnf(c6, plain, % 31.85/4.37 ok(findmin_cpq_eff(triple(sK2,X3,sK4))), % 31.85/4.37 inference(reflexivity, [assumptions([a1])], [c5])). % 31.85/4.37 % 31.85/4.37 cnf(c7, axiom, % 31.85/4.37 sP1(X4,X5) | ~ok(findmin_cpq_eff(triple(X4,X5,X6)))). % 31.85/4.37 cnf(a2, assumption, % 31.85/4.37 findmin_cpq_eff(triple(sK2,X3,sK4)) = findmin_cpq_eff(triple(X4,X5,X6))). % 31.85/4.37 cnf(c8, plain, % 31.85/4.37 $false, % 31.85/4.37 inference(strict_predicate_extension, [assumptions([a2])], [c6, c7])). % 31.85/4.37 cnf(c9, plain, % 31.85/4.37 sP1(X4,X5), % 31.85/4.37 inference(strict_predicate_extension, [assumptions([a2])], [c6, c7])). % 31.85/4.37 % 31.85/4.37 cnf(c10, axiom, % 31.85/4.37 ~sP1(X7,create_slb)). % 31.85/4.37 cnf(a3, assumption, % 31.85/4.37 X4 = X7). % 31.85/4.37 cnf(a4, assumption, % 31.85/4.37 X5 = create_slb). % 31.85/4.37 cnf(c11, plain, % 31.85/4.37 $false, % 31.85/4.37 inference(strict_predicate_extension, [assumptions([a3, a4])], [c9, c10])). % 31.85/4.37 cnf(c12, plain, % 31.85/4.37 $false, % 31.85/4.37 inference(strict_predicate_extension, [assumptions([a3, a4])], [c9, c10])). % 31.85/4.37 % 31.85/4.37 cnf(c13, axiom, % 31.85/4.37 ~contains_cpq(triple(sK2,sK3,sK4),removemin_cpq_res(triple(sK2,sK3,sK4)))). % 31.85/4.37 cnf(a5, assumption, % 31.85/4.37 removemin_cpq_res(triple(sK2,sK3,sK4)) = removemin_cpq_res(triple(X0,X1,X2))). % 31.85/4.37 cnf(a6, assumption, % 31.85/4.37 findmin_pqp_res(X0) = X8). % 31.85/4.37 cnf(c14, plain, % 31.85/4.37 $false, % 31.85/4.37 inference(strict_subterm_extension, [assumptions([a5, a6])], [c4, c13])). % 31.85/4.37 cnf(c15, plain, % 31.85/4.37 $false, % 31.85/4.37 inference(strict_subterm_extension, [assumptions([a5, a6])], [c4, c13])). % 31.85/4.37 cnf(c16, plain, % 31.85/4.37 ~contains_cpq(triple(sK2,sK3,sK4),X8), % 31.85/4.37 inference(strict_subterm_extension, [assumptions([a5, a6])], [c4, c13])). % 31.85/4.37 % 31.85/4.37 cnf(c17, axiom, % 31.85/4.37 contains_cpq(triple(X9,X10,X11),X12) | ~contains_slb(X10,X12)). % 31.85/4.37 cnf(a7, assumption, % 31.85/4.37 triple(sK2,sK3,sK4) = triple(X9,X10,X11)). % 31.85/4.37 cnf(a8, assumption, % 31.85/4.37 X8 = X12). % 31.85/4.37 cnf(c18, plain, % 31.85/4.37 $false, % 31.85/4.37 inference(strict_predicate_extension, [assumptions([a7, a8])], [c16, c17])). % 31.85/4.37 cnf(c19, plain, % 31.85/4.37 ~contains_slb(X10,X12), % 31.85/4.37 inference(strict_predicate_extension, [assumptions([a7, a8])], [c16, c17])). % 31.85/4.37 % 31.85/4.37 cnf(c20, axiom, % 31.85/4.37 contains_slb(X13,findmin_pqp_res(X14)) | ~sP1(X14,X13)). % 31.85/4.37 cnf(a9, assumption, % 31.85/4.37 X10 = X13). % 31.85/4.37 cnf(a10, assumption, % 31.85/4.37 X12 = findmin_pqp_res(X14)). % 31.85/4.37 cnf(c21, plain, % 31.85/4.37 $false, % 31.85/4.37 inference(strict_predicate_extension, [assumptions([a9, a10])], [c19, c20])). % 31.85/4.37 cnf(c22, plain, % 31.85/4.37 ~sP1(X14,X13), % 31.85/4.37 inference(strict_predicate_extension, [assumptions([a9, a10])], [c19, c20])). % 31.85/4.37 % 31.85/4.37 cnf(c23, axiom, % 31.85/4.37 sP1(X15,X16) | ~ok(findmin_cpq_eff(triple(X15,X16,X17)))). % 31.85/4.37 cnf(a11, assumption, % 31.85/4.37 X14 = X15). % 31.85/4.37 cnf(a12, assumption, % 31.85/4.37 X13 = X16). % 31.85/4.37 cnf(c24, plain, % 31.85/4.37 $false, % 31.85/4.37 inference(strict_predicate_extension, [assumptions([a11, a12])], [c22, c23])). % 31.85/4.37 cnf(c25, plain, % 31.85/4.37 ~ok(findmin_cpq_eff(triple(X15,X16,X17))), % 31.85/4.37 inference(strict_predicate_extension, [assumptions([a11, a12])], [c22, c23])). % 31.85/4.37 % 31.85/4.37 cnf(c26, plain, % 31.85/4.37 ok(findmin_cpq_eff(triple(sK2,sK3,sK4)))). % 31.85/4.37 cnf(a13, assumption, % 31.85/4.37 findmin_cpq_eff(triple(X15,X16,X17)) = findmin_cpq_eff(triple(sK2,sK3,sK4))). % 31.85/4.37 cnf(c27, plain, % 31.85/4.37 $false, % 31.85/4.37 inference(predicate_reduction, [assumptions([a13])], [c25, c26])). % 31.85/4.37 % 31.85/4.37 cnf(c28, plain, % 31.85/4.37 $false, % 31.85/4.37 inference(constraint_solving, [ % 31.85/4.37 bind(X0, sK2), % 31.85/4.37 bind(X1, sK3), % 31.85/4.37 bind(X2, sK4), % 31.85/4.37 bind(X3, create_slb), % 31.85/4.37 bind(X4, sK2), % 31.85/4.37 bind(X5, create_slb), % 31.85/4.37 bind(X6, sK4), % 31.85/4.37 bind(X7, sK2), % 31.85/4.37 bind(X8, findmin_pqp_res(X0)), % 31.85/4.37 bind(X9, sK2), % 31.85/4.37 bind(X10, sK3), % 31.85/4.37 bind(X11, sK4), % 31.85/4.37 bind(X12, findmin_pqp_res(X0)), % 31.85/4.37 bind(X13, sK3), % 31.85/4.37 bind(X14, sK2), % 31.85/4.37 bind(X15, sK2), % 31.85/4.37 bind(X16, sK3), % 31.85/4.37 bind(X17, sK4) % 31.85/4.37 ], % 31.85/4.37 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])). % 31.85/4.37 % 31.85/4.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------