%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET025-9 : TPTP v8.1.0. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n029.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 : Tue Jul 19 02:42:39 EDT 2022 % Result : Unsatisfiable 0.13s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.11 % Problem : SET025-9 : TPTP v8.1.0. Released v1.0.0. % 0.10/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.33 % Computer : n029.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Sun Jul 10 17:19:01 EDT 2022 % 0.13/0.33 % CPUTime : % 0.13/0.35 % SZS status Unsatisfiable % 0.13/0.35 % SZS output begin IncompleteProof % 0.13/0.35 cnf(c0, axiom, % 0.13/0.35 ~little_set(a)). % 0.13/0.35 cnf(c1, plain, % 0.13/0.35 ~little_set(a), % 0.13/0.35 inference(start, [], [c0])). % 0.13/0.35 % 0.13/0.35 cnf(c2, axiom, % 0.13/0.35 little_set(non_ordered_pair(X0,X1))). % 0.13/0.35 cnf(a0, assumption, % 0.13/0.35 X2 = a). % 0.13/0.35 cnf(c3, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(lazy_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.13/0.35 cnf(c4, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(lazy_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.13/0.35 cnf(c5, plain, % 0.13/0.35 non_ordered_pair(X0,X1) != X2, % 0.13/0.35 inference(lazy_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.13/0.35 % 0.13/0.35 cnf(c6, axiom, % 0.13/0.35 non_ordered_pair(non_ordered_pair(f2(X3),f2(X3)),non_ordered_pair(f2(X3),f3(X3))) = X3 | ~ordered_pair_predicate(X3)). % 0.13/0.35 cnf(a1, assumption, % 0.13/0.35 non_ordered_pair(X0,X1) = non_ordered_pair(non_ordered_pair(f2(X3),f2(X3)),non_ordered_pair(f2(X3),f3(X3)))). % 0.13/0.35 cnf(c7, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 0.13/0.35 cnf(c8, plain, % 0.13/0.35 ~ordered_pair_predicate(X3), % 0.13/0.35 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 0.13/0.35 cnf(c9, plain, % 0.13/0.35 X4 != X3 | X4 != X2, % 0.13/0.35 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 0.13/0.35 % 0.13/0.35 cnf(a2, assumption, % 0.13/0.35 X4 = X3). % 0.13/0.35 cnf(c10, plain, % 0.13/0.35 X4 != X2, % 0.13/0.35 inference(reflexivity, [assumptions([a2])], [c9])). % 0.13/0.35 % 0.13/0.35 cnf(a3, assumption, % 0.13/0.35 X4 = X2). % 0.13/0.35 cnf(c11, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(reflexivity, [assumptions([a3])], [c10])). % 0.13/0.35 % 0.13/0.35 cnf(c12, axiom, % 0.13/0.35 ordered_pair_predicate(a)). % 0.13/0.35 cnf(a4, assumption, % 0.13/0.35 X3 = a). % 0.13/0.35 cnf(c13, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a4])], [c8, c12])). % 0.13/0.35 cnf(c14, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a4])], [c8, c12])). % 0.13/0.35 % 0.13/0.35 cnf(c15, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(constraint_solving, [ % 0.13/0.35 bind(X0, non_ordered_pair(f2(X3),f2(X3))), % 0.13/0.35 bind(X1, non_ordered_pair(f2(X3),f3(X3))), % 0.13/0.35 bind(X2, a), % 0.13/0.35 bind(X3, a), % 0.13/0.35 bind(X4, a) % 0.13/0.35 ], % 0.13/0.35 [a0, a1, a2, a3, a4])). % 0.13/0.35 % 0.13/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------