%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LAT273-2 : TPTP v8.1.0. Released v3.2.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 : Sun Jul 17 05:38:50 EDT 2022 % Result : Unsatisfiable 0.12s 0.34s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : LAT273-2 : TPTP v8.1.0. Released v3.2.0. % 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n016.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Wed Jun 29 17:41:39 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.34 % SZS status Unsatisfiable % 0.12/0.34 % SZS output begin IncompleteProof % 0.12/0.34 cnf(c0, axiom, % 0.12/0.34 c_in(v_b,v_A,t_a)). % 0.12/0.34 cnf(c1, plain, % 0.12/0.34 c_in(v_b,v_A,t_a), % 0.12/0.34 inference(start, [], [c0])). % 0.12/0.34 % 0.12/0.34 cnf(c2, axiom, % 0.12/0.34 c_in(c_Pair(X0,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) | ~c_in(c_Pair(v_sko__4mi(X2,v_r,X1),X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) | ~c_in(X1,v_A,t_a) | ~c_Tarski_OisLub(X2,v_cl,X0,t_a)). % 0.12/0.34 cnf(a0, assumption, % 0.12/0.34 v_b = X1). % 0.12/0.34 cnf(a1, assumption, % 0.12/0.34 v_A = v_A). % 0.12/0.34 cnf(a2, assumption, % 0.12/0.34 t_a = t_a). % 0.12/0.34 cnf(c3, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.12/0.34 cnf(c4, plain, % 0.12/0.34 c_in(c_Pair(X0,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) | ~c_in(c_Pair(v_sko__4mi(X2,v_r,X1),X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) | ~c_Tarski_OisLub(X2,v_cl,X0,t_a), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.12/0.34 % 0.12/0.34 cnf(c5, axiom, % 0.12/0.34 ~c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a))). % 0.12/0.34 cnf(a3, assumption, % 0.12/0.34 c_Pair(X0,X1,t_a,t_a) = c_Pair(v_L,v_b,t_a,t_a)). % 0.12/0.34 cnf(a4, assumption, % 0.12/0.34 v_r = v_r). % 0.12/0.34 cnf(a5, assumption, % 0.12/0.34 tc_prod(t_a,t_a) = tc_prod(t_a,t_a)). % 0.12/0.34 cnf(c6, plain, % 0.12/0.34 ~c_in(c_Pair(v_sko__4mi(X2,v_r,X1),X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) | ~c_Tarski_OisLub(X2,v_cl,X0,t_a), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])). % 0.12/0.34 cnf(c7, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])). % 0.12/0.34 % 0.12/0.34 cnf(c8, axiom, % 0.12/0.34 c_in(c_Pair(X3,X4,X5,X5),X6,tc_prod(X5,X5)) | ~c_lessequals(X7,c_Tarski_Ointerval(X6,X8,X4,X5),tc_set(X5)) | ~c_in(X3,X7,X5)). % 0.12/0.34 cnf(a6, assumption, % 0.12/0.34 c_Pair(v_sko__4mi(X2,v_r,X1),X1,t_a,t_a) = c_Pair(X3,X4,X5,X5)). % 0.12/0.34 cnf(a7, assumption, % 0.12/0.34 v_r = X6). % 0.12/0.34 cnf(a8, assumption, % 0.12/0.34 tc_prod(t_a,t_a) = tc_prod(X5,X5)). % 0.12/0.34 cnf(c9, plain, % 0.12/0.34 ~c_Tarski_OisLub(X2,v_cl,X0,t_a), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c6, c8])). % 0.12/0.34 cnf(c10, plain, % 0.12/0.34 ~c_lessequals(X7,c_Tarski_Ointerval(X6,X8,X4,X5),tc_set(X5)) | ~c_in(X3,X7,X5), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c6, c8])). % 0.12/0.34 % 0.12/0.34 cnf(c11, axiom, % 0.12/0.34 c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a))). % 0.12/0.34 cnf(a9, assumption, % 0.12/0.34 X7 = v_S). % 0.12/0.34 cnf(a10, assumption, % 0.12/0.34 c_Tarski_Ointerval(X6,X8,X4,X5) = c_Tarski_Ointerval(v_r,v_a,v_b,t_a)). % 0.12/0.34 cnf(a11, assumption, % 0.12/0.34 tc_set(X5) = tc_set(t_a)). % 0.12/0.34 cnf(c12, plain, % 0.12/0.34 ~c_in(X3,X7,X5), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c10, c11])). % 0.12/0.34 cnf(c13, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c10, c11])). % 0.12/0.34 % 0.12/0.34 cnf(c14, axiom, % 0.12/0.34 c_in(v_sko__4mi(X9,v_r,X10),X9,t_a) | c_in(c_Pair(X11,X10,t_a,t_a),v_r,tc_prod(t_a,t_a)) | ~c_in(X10,v_A,t_a) | ~c_Tarski_OisLub(X9,v_cl,X11,t_a)). % 0.12/0.34 cnf(a12, assumption, % 0.12/0.34 X3 = v_sko__4mi(X9,v_r,X10)). % 0.12/0.34 cnf(a13, assumption, % 0.12/0.34 X7 = X9). % 0.12/0.34 cnf(a14, assumption, % 0.12/0.34 X5 = t_a). % 0.12/0.34 cnf(c15, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c12, c14])). % 0.12/0.34 cnf(c16, plain, % 0.12/0.34 c_in(c_Pair(X11,X10,t_a,t_a),v_r,tc_prod(t_a,t_a)) | ~c_in(X10,v_A,t_a) | ~c_Tarski_OisLub(X9,v_cl,X11,t_a), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c12, c14])). % 0.12/0.34 % 0.12/0.34 cnf(c17, plain, % 0.12/0.34 ~c_in(c_Pair(X0,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))). % 0.12/0.34 cnf(a15, assumption, % 0.12/0.34 c_Pair(X11,X10,t_a,t_a) = c_Pair(X0,X1,t_a,t_a)). % 0.12/0.34 cnf(a16, assumption, % 0.12/0.34 v_r = v_r). % 0.12/0.34 cnf(a17, assumption, % 0.12/0.34 tc_prod(t_a,t_a) = tc_prod(t_a,t_a)). % 0.12/0.34 cnf(c18, plain, % 0.12/0.34 ~c_in(X10,v_A,t_a) | ~c_Tarski_OisLub(X9,v_cl,X11,t_a), % 0.12/0.34 inference(predicate_reduction, [assumptions([a15, a16, a17])], [c16, c17])). % 0.12/0.34 % 0.12/0.34 cnf(c19, plain, % 0.12/0.34 c_in(v_b,v_A,t_a)). % 0.12/0.34 cnf(a18, assumption, % 0.12/0.34 X10 = v_b). % 0.12/0.34 cnf(a19, assumption, % 0.12/0.34 v_A = v_A). % 0.12/0.34 cnf(a20, assumption, % 0.12/0.34 t_a = t_a). % 0.12/0.34 cnf(c20, plain, % 0.12/0.34 ~c_Tarski_OisLub(X9,v_cl,X11,t_a), % 0.12/0.34 inference(predicate_reduction, [assumptions([a18, a19, a20])], [c18, c19])). % 0.12/0.34 % 0.12/0.34 cnf(c21, axiom, % 0.12/0.34 c_Tarski_OisLub(v_S,v_cl,v_L,t_a)). % 0.12/0.34 cnf(a21, assumption, % 0.12/0.34 X9 = v_S). % 0.12/0.34 cnf(a22, assumption, % 0.12/0.34 v_cl = v_cl). % 0.12/0.34 cnf(a23, assumption, % 0.12/0.34 X11 = v_L). % 0.12/0.34 cnf(a24, assumption, % 0.12/0.34 t_a = t_a). % 0.12/0.34 cnf(c22, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a21, a22, a23, a24])], [c20, c21])). % 0.12/0.34 cnf(c23, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a21, a22, a23, a24])], [c20, c21])). % 0.12/0.34 % 0.12/0.34 cnf(c24, plain, % 0.12/0.34 c_Tarski_OisLub(X9,v_cl,X11,t_a)). % 0.12/0.34 cnf(a25, assumption, % 0.12/0.34 X2 = X9). % 0.12/0.34 cnf(a26, assumption, % 0.12/0.34 v_cl = v_cl). % 0.12/0.34 cnf(a27, assumption, % 0.12/0.34 X0 = X11). % 0.12/0.34 cnf(a28, assumption, % 0.12/0.34 t_a = t_a). % 0.12/0.34 cnf(c25, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(predicate_reduction, [assumptions([a25, a26, a27, a28])], [c9, c24])). % 0.12/0.34 % 0.12/0.34 cnf(c26, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(constraint_solving, [ % 0.12/0.34 bind(X0, v_L), % 0.12/0.34 bind(X1, v_b), % 0.12/0.34 bind(X2, v_S), % 0.12/0.34 bind(X3, v_sko__4mi(X2,v_r,X1)), % 0.12/0.34 bind(X4, v_b), % 0.12/0.34 bind(X5, t_a), % 0.12/0.34 bind(X6, v_r), % 0.12/0.34 bind(X7, v_S), % 0.12/0.34 bind(X8, v_a), % 0.12/0.34 bind(X9, v_S), % 0.12/0.34 bind(X10, v_b), % 0.12/0.34 bind(X11, v_L) % 0.12/0.34 ], % 0.12/0.34 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25, a26, a27, a28])). % 0.12/0.34 % 0.12/0.34 % SZS output end IncompleteProof %------------------------------------------------------------------------------