%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LAT272-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 : n028.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:49 EDT 2022 % Result : Unsatisfiable 0.11s 0.33s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.09/0.11 % Problem : LAT272-2 : TPTP v8.1.0. Released v3.2.0. % 0.09/0.11 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.11/0.32 % Computer : n028.cluster.edu % 0.11/0.32 % Model : x86_64 x86_64 % 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.32 % Memory : 8042.1875MB % 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.32 % CPULimit : 300 % 0.11/0.32 % WCLimit : 600 % 0.11/0.32 % DateTime : Wed Jun 29 06:26:43 EDT 2022 % 0.11/0.32 % CPUTime : % 0.11/0.33 % SZS status Unsatisfiable % 0.11/0.33 % SZS output begin IncompleteProof % 0.11/0.33 cnf(c0, axiom, % 0.11/0.33 c_Tarski_OisLub(v_S,v_cl,v_L,t_a)). % 0.11/0.33 cnf(c1, plain, % 0.11/0.33 c_Tarski_OisLub(v_S,v_cl,v_L,t_a), % 0.11/0.33 inference(start, [], [c0])). % 0.11/0.33 % 0.11/0.33 cnf(c2, axiom, % 0.11/0.33 c_in(c_Pair(X0,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) | ~c_in(X0,X2,t_a) | ~c_Tarski_OisLub(X2,v_cl,X1,t_a)). % 0.11/0.33 cnf(a0, assumption, % 0.11/0.33 v_S = X2). % 0.11/0.33 cnf(a1, assumption, % 0.11/0.33 v_cl = v_cl). % 0.11/0.33 cnf(a2, assumption, % 0.11/0.33 v_L = X1). % 0.11/0.33 cnf(a3, assumption, % 0.11/0.33 t_a = t_a). % 0.11/0.33 cnf(c3, plain, % 0.11/0.33 $false, % 0.11/0.33 inference(strict_predicate_extension, [assumptions([a0, a1, a2, a3])], [c1, c2])). % 0.11/0.33 cnf(c4, plain, % 0.11/0.33 c_in(c_Pair(X0,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) | ~c_in(X0,X2,t_a), % 0.11/0.33 inference(strict_predicate_extension, [assumptions([a0, a1, a2, a3])], [c1, c2])). % 0.11/0.33 % 0.11/0.33 cnf(c5, axiom, % 0.11/0.33 ~c_in(c_Pair(v_x,v_L,t_a,t_a),v_r,tc_prod(t_a,t_a))). % 0.11/0.33 cnf(a4, assumption, % 0.11/0.33 c_Pair(X0,X1,t_a,t_a) = c_Pair(v_x,v_L,t_a,t_a)). % 0.11/0.33 cnf(a5, assumption, % 0.11/0.33 v_r = v_r). % 0.11/0.33 cnf(a6, assumption, % 0.11/0.33 tc_prod(t_a,t_a) = tc_prod(t_a,t_a)). % 0.11/0.33 cnf(c6, plain, % 0.11/0.33 ~c_in(X0,X2,t_a), % 0.11/0.33 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c4, c5])). % 0.11/0.33 cnf(c7, plain, % 0.11/0.33 $false, % 0.11/0.33 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c4, c5])). % 0.11/0.33 % 0.11/0.33 cnf(c8, axiom, % 0.11/0.33 c_in(v_x,v_S,t_a)). % 0.11/0.33 cnf(a7, assumption, % 0.11/0.33 X0 = v_x). % 0.11/0.33 cnf(a8, assumption, % 0.11/0.33 X2 = v_S). % 0.11/0.33 cnf(a9, assumption, % 0.11/0.33 t_a = t_a). % 0.11/0.33 cnf(c9, plain, % 0.11/0.33 $false, % 0.11/0.33 inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c6, c8])). % 0.11/0.33 cnf(c10, plain, % 0.11/0.33 $false, % 0.11/0.33 inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c6, c8])). % 0.11/0.33 % 0.11/0.33 cnf(c11, plain, % 0.11/0.33 $false, % 0.11/0.33 inference(constraint_solving, [ % 0.11/0.33 bind(X0, v_x), % 0.11/0.33 bind(X1, v_L), % 0.11/0.33 bind(X2, v_S) % 0.11/0.33 ], % 0.11/0.33 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])). % 0.11/0.33 % 0.11/0.33 % SZS output end IncompleteProof %------------------------------------------------------------------------------