%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWV390+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 : n024.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:46 EDT 2022 % Result : Theorem 9.68s 1.62s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWV390+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 : n024.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 : Tue Jun 14 21:53:33 EDT 2022 % 0.13/0.34 % CPUTime : % 9.68/1.62 % SZS status Theorem % 9.68/1.62 % SZS output begin IncompleteProof % 9.68/1.62 cnf(c0, axiom, % 9.68/1.62 ~check_cpq(triple(sK3,sK4,sK5))). % 9.68/1.62 cnf(c1, plain, % 9.68/1.62 ~check_cpq(triple(sK3,sK4,sK5)), % 9.68/1.62 inference(start, [], [c0])). % 9.68/1.62 % 9.68/1.62 cnf(c2, axiom, % 9.68/1.62 check_cpq(triple(X0,X1,X2)) | ~less_than(sK2(X1),sK1(X1))). % 9.68/1.62 cnf(a0, assumption, % 9.68/1.62 triple(sK3,sK4,sK5) = triple(X0,X1,X2)). % 9.68/1.62 cnf(c3, plain, % 9.68/1.62 $false, % 9.68/1.62 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 9.68/1.62 cnf(c4, plain, % 9.68/1.62 ~less_than(sK2(X1),sK1(X1)), % 9.68/1.62 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 9.68/1.62 % 9.68/1.62 cnf(c5, axiom, % 9.68/1.62 less_than(X3,X4) | ~pair_in_list(X5,X4,X3) | ~check_cpq(triple(X6,X5,X7))). % 9.68/1.62 cnf(a1, assumption, % 9.68/1.62 sK2(X1) = X3). % 9.68/1.62 cnf(a2, assumption, % 9.68/1.62 sK1(X1) = X4). % 9.68/1.62 cnf(c6, plain, % 9.68/1.62 $false, % 9.68/1.62 inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])). % 9.68/1.62 cnf(c7, plain, % 9.68/1.62 ~pair_in_list(X5,X4,X3) | ~check_cpq(triple(X6,X5,X7)), % 9.68/1.62 inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])). % 9.68/1.62 % 9.68/1.62 cnf(c8, axiom, % 9.68/1.62 check_cpq(triple(X8,X9,X10)) | pair_in_list(X9,sK1(X9),sK2(X9))). % 9.68/1.62 cnf(a3, assumption, % 9.68/1.62 X5 = X9). % 9.68/1.62 cnf(a4, assumption, % 9.68/1.62 X4 = sK1(X9)). % 9.68/1.62 cnf(a5, assumption, % 9.68/1.62 X3 = sK2(X9)). % 9.68/1.62 cnf(c9, plain, % 9.68/1.62 ~check_cpq(triple(X6,X5,X7)), % 9.68/1.62 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c7, c8])). % 9.68/1.62 cnf(c10, plain, % 9.68/1.62 check_cpq(triple(X8,X9,X10)), % 9.68/1.62 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c7, c8])). % 9.68/1.62 % 9.68/1.62 cnf(c11, plain, % 9.68/1.62 ~check_cpq(triple(sK3,sK4,sK5))). % 9.68/1.62 cnf(a6, assumption, % 9.68/1.62 triple(X8,X9,X10) = triple(sK3,sK4,sK5)). % 9.68/1.62 cnf(c12, plain, % 9.68/1.62 $false, % 9.68/1.62 inference(predicate_reduction, [assumptions([a6])], [c10, c11])). % 9.68/1.62 % 9.68/1.62 cnf(c13, axiom, % 9.68/1.62 check_cpq(triple(X11,X12,X13)) | ~check_cpq(triple(X11,insert_slb(X12,pair(X14,X15)),X13)) | ~less_than(X15,X14)). % 9.68/1.62 cnf(a7, assumption, % 9.68/1.62 triple(X6,X5,X7) = triple(X11,X12,X13)). % 9.68/1.62 cnf(c14, plain, % 9.68/1.62 $false, % 9.68/1.62 inference(strict_predicate_extension, [assumptions([a7])], [c9, c13])). % 9.68/1.62 cnf(c15, plain, % 9.68/1.62 ~check_cpq(triple(X11,insert_slb(X12,pair(X14,X15)),X13)) | ~less_than(X15,X14), % 9.68/1.62 inference(strict_predicate_extension, [assumptions([a7])], [c9, c13])). % 9.68/1.62 % 9.68/1.62 cnf(c16, axiom, % 9.68/1.62 insert_cpq(triple(X16,X17,X18),X19) = triple(insert_pqp(X16,X19),insert_slb(X17,pair(X19,bottom)),X18)). % 9.68/1.62 cnf(a8, assumption, % 9.68/1.62 triple(X11,insert_slb(X12,pair(X14,X15)),X13) = triple(insert_pqp(X16,X19),insert_slb(X17,pair(X19,bottom)),X18)). % 9.68/1.62 cnf(c17, plain, % 9.68/1.62 ~less_than(X15,X14), % 9.68/1.62 inference(strict_function_extension, [assumptions([a8])], [c15, c16])). % 9.68/1.62 cnf(c18, plain, % 9.68/1.62 $false, % 9.68/1.62 inference(strict_function_extension, [assumptions([a8])], [c15, c16])). % 9.68/1.62 cnf(c19, plain, % 9.68/1.62 X20 != insert_cpq(triple(X16,X17,X18),X19) | ~check_cpq(X20), % 9.68/1.62 inference(strict_function_extension, [assumptions([a8])], [c15, c16])). % 9.68/1.62 % 9.68/1.62 cnf(a9, assumption, % 9.68/1.62 X20 = insert_cpq(triple(X16,X17,X18),X19)). % 9.68/1.62 cnf(c20, plain, % 9.68/1.62 ~check_cpq(X20), % 9.68/1.62 inference(reflexivity, [assumptions([a9])], [c19])). % 9.68/1.62 % 9.68/1.62 cnf(c21, axiom, % 9.68/1.62 check_cpq(insert_cpq(triple(sK3,sK4,sK5),sK6))). % 9.68/1.62 cnf(a10, assumption, % 9.68/1.62 X20 = insert_cpq(triple(sK3,sK4,sK5),sK6)). % 9.68/1.62 cnf(c22, plain, % 9.68/1.62 $false, % 9.68/1.62 inference(strict_predicate_extension, [assumptions([a10])], [c20, c21])). % 9.68/1.62 cnf(c23, plain, % 9.68/1.62 $false, % 9.68/1.62 inference(strict_predicate_extension, [assumptions([a10])], [c20, c21])). % 9.68/1.62 % 9.68/1.62 cnf(c24, axiom, % 9.68/1.62 less_than(bottom,X21)). % 9.68/1.62 cnf(a11, assumption, % 9.68/1.62 X15 = bottom). % 9.68/1.62 cnf(a12, assumption, % 9.68/1.62 X14 = X21). % 9.68/1.62 cnf(c25, plain, % 9.68/1.62 $false, % 9.68/1.62 inference(strict_predicate_extension, [assumptions([a11, a12])], [c17, c24])). % 9.68/1.62 cnf(c26, plain, % 9.68/1.62 $false, % 9.68/1.62 inference(strict_predicate_extension, [assumptions([a11, a12])], [c17, c24])). % 9.68/1.62 % 9.68/1.62 cnf(c27, plain, % 9.68/1.62 $false, % 9.68/1.62 inference(constraint_solving, [ % 9.68/1.62 bind(X0, sK3), % 9.68/1.62 bind(X1, sK4), % 9.68/1.62 bind(X2, sK5), % 9.68/1.62 bind(X3, sK2(X1)), % 9.68/1.62 bind(X4, sK1(X1)), % 9.68/1.62 bind(X5, sK4), % 9.68/1.62 bind(X6, insert_pqp(X16,X19)), % 9.68/1.62 bind(X7, sK5), % 9.68/1.62 bind(X8, sK3), % 9.68/1.62 bind(X9, sK4), % 9.68/1.62 bind(X10, sK5), % 9.68/1.62 bind(X11, insert_pqp(X16,X19)), % 9.68/1.62 bind(X12, sK4), % 9.68/1.62 bind(X13, sK5), % 9.68/1.62 bind(X14, sK6), % 9.68/1.62 bind(X15, bottom), % 9.68/1.62 bind(X16, sK3), % 9.68/1.62 bind(X17, sK4), % 9.68/1.62 bind(X18, sK5), % 9.68/1.62 bind(X19, sK6), % 9.68/1.62 bind(X20, insert_cpq(triple(X16,X17,X18),X19)), % 9.68/1.62 bind(X21, sK6) % 9.68/1.62 ], % 9.68/1.62 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12])). % 9.68/1.62 % 9.68/1.62 % SZS output end IncompleteProof %------------------------------------------------------------------------------