%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : CAT019-3 : 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 : n025.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 : Fri Jul 15 00:03:29 EDT 2022 % Result : Unsatisfiable 131.66s 17.15s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : CAT019-3 : TPTP v8.1.0. Released v1.0.0. % 0.06/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n025.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 : Sun May 29 19:52:56 EDT 2022 % 0.12/0.34 % CPUTime : % 131.66/17.15 % SZS status Unsatisfiable % 131.66/17.15 % SZS output begin IncompleteProof % 131.66/17.15 cnf(c0, axiom, % 131.66/17.15 a != b). % 131.66/17.15 cnf(c1, plain, % 131.66/17.15 a != b, % 131.66/17.15 inference(start, [], [c0])). % 131.66/17.15 % 131.66/17.15 cnf(c2, axiom, % 131.66/17.15 X0 = X1 | there_exists(f1(X0,X1))). % 131.66/17.15 cnf(a0, assumption, % 131.66/17.15 b = X1). % 131.66/17.15 cnf(c3, plain, % 131.66/17.15 $false, % 131.66/17.15 inference(variable_extension, [assumptions([a0])], [c1, c2])). % 131.66/17.15 cnf(c4, plain, % 131.66/17.15 there_exists(f1(X0,X1)), % 131.66/17.15 inference(variable_extension, [assumptions([a0])], [c1, c2])). % 131.66/17.15 cnf(c5, plain, % 131.66/17.15 X0 != X2 | a != X2, % 131.66/17.15 inference(variable_extension, [assumptions([a0])], [c1, c2])). % 131.66/17.15 % 131.66/17.15 cnf(a1, assumption, % 131.66/17.15 X0 = X2). % 131.66/17.15 cnf(c6, plain, % 131.66/17.15 a != X2, % 131.66/17.15 inference(reflexivity, [assumptions([a1])], [c5])). % 131.66/17.15 % 131.66/17.15 cnf(a2, assumption, % 131.66/17.15 a = X2). % 131.66/17.15 cnf(c7, plain, % 131.66/17.15 $false, % 131.66/17.15 inference(reflexivity, [assumptions([a2])], [c6])). % 131.66/17.15 % 131.66/17.15 cnf(c8, axiom, % 131.66/17.15 X3 = X4 | f1(X3,X4) = X4 | f1(X3,X4) = X3). % 131.66/17.15 cnf(a3, assumption, % 131.66/17.15 f1(X0,X1) = f1(X3,X4)). % 131.66/17.15 cnf(c9, plain, % 131.66/17.15 $false, % 131.66/17.15 inference(strict_function_extension, [assumptions([a3])], [c4, c8])). % 131.66/17.15 cnf(c10, plain, % 131.66/17.15 X3 = X4 | f1(X3,X4) = X4, % 131.66/17.15 inference(strict_function_extension, [assumptions([a3])], [c4, c8])). % 131.66/17.15 cnf(c11, plain, % 131.66/17.15 X5 != X3 | there_exists(X5), % 131.66/17.15 inference(strict_function_extension, [assumptions([a3])], [c4, c8])). % 131.66/17.15 % 131.66/17.15 cnf(a4, assumption, % 131.66/17.15 X5 = X3). % 131.66/17.15 cnf(c12, plain, % 131.66/17.15 there_exists(X5), % 131.66/17.15 inference(reflexivity, [assumptions([a4])], [c11])). % 131.66/17.15 % 131.66/17.15 cnf(c13, axiom, % 131.66/17.15 a = b | ~there_exists(a)). % 131.66/17.15 cnf(a5, assumption, % 131.66/17.15 X5 = a). % 131.66/17.15 cnf(c14, plain, % 131.66/17.15 $false, % 131.66/17.15 inference(strict_predicate_extension, [assumptions([a5])], [c12, c13])). % 131.66/17.15 cnf(c15, plain, % 131.66/17.15 a = b, % 131.66/17.15 inference(strict_predicate_extension, [assumptions([a5])], [c12, c13])). % 131.66/17.15 % 131.66/17.15 cnf(c16, plain, % 131.66/17.15 a != b). % 131.66/17.15 cnf(a6, assumption, % 131.66/17.15 b = b). % 131.66/17.15 cnf(a7, assumption, % 131.66/17.15 a = X6). % 131.66/17.15 cnf(c17, plain, % 131.66/17.15 $false, % 131.66/17.15 inference(subterm_reduction, [assumptions([a6, a7])], [c15, c16])). % 131.66/17.15 cnf(c18, plain, % 131.66/17.15 a != X6, % 131.66/17.15 inference(subterm_reduction, [assumptions([a6, a7])], [c15, c16])). % 131.66/17.15 % 131.66/17.15 cnf(a8, assumption, % 131.66/17.15 a = X6). % 131.66/17.15 cnf(c19, plain, % 131.66/17.15 $false, % 131.66/17.15 inference(reflexivity, [assumptions([a8])], [c18])). % 131.66/17.15 % 131.66/17.15 cnf(c20, plain, % 131.66/17.15 a != b). % 131.66/17.15 cnf(a9, assumption, % 131.66/17.15 b = X4). % 131.66/17.15 cnf(c21, plain, % 131.66/17.15 f1(X3,X4) = X4, % 131.66/17.15 inference(subterm_reduction, [assumptions([a9])], [c10, c20])). % 131.66/17.15 cnf(c22, plain, % 131.66/17.15 a != X3, % 131.66/17.15 inference(subterm_reduction, [assumptions([a9])], [c10, c20])). % 131.66/17.15 % 131.66/17.15 cnf(a10, assumption, % 131.66/17.15 a = X3). % 131.66/17.15 cnf(c23, plain, % 131.66/17.15 $false, % 131.66/17.15 inference(reflexivity, [assumptions([a10])], [c22])). % 131.66/17.15 % 131.66/17.15 cnf(c24, plain, % 131.66/17.15 there_exists(f1(X0,X1))). % 131.66/17.15 cnf(a11, assumption, % 131.66/17.15 f1(X0,X1) = f1(X3,X4)). % 131.66/17.15 cnf(c25, plain, % 131.66/17.15 $false, % 131.66/17.15 inference(subterm_reduction, [assumptions([a11])], [c21, c24])). % 131.66/17.15 cnf(c26, plain, % 131.66/17.15 there_exists(X4), % 131.66/17.15 inference(subterm_reduction, [assumptions([a11])], [c21, c24])). % 131.66/17.15 % 131.66/17.15 cnf(c27, axiom, % 131.66/17.15 a = b | ~there_exists(b)). % 131.66/17.15 cnf(a12, assumption, % 131.66/17.15 X4 = b). % 131.66/17.15 cnf(c28, plain, % 131.66/17.15 $false, % 131.66/17.15 inference(strict_predicate_extension, [assumptions([a12])], [c26, c27])). % 131.66/17.15 cnf(c29, plain, % 131.66/17.15 a = b, % 131.66/17.15 inference(strict_predicate_extension, [assumptions([a12])], [c26, c27])). % 131.66/17.15 % 131.66/17.15 cnf(c30, plain, % 131.66/17.15 a != b). % 131.66/17.15 cnf(a13, assumption, % 131.66/17.15 b = b). % 131.66/17.15 cnf(a14, assumption, % 131.66/17.15 a = X7). % 131.66/17.15 cnf(c31, plain, % 131.66/17.15 $false, % 131.66/17.15 inference(subterm_reduction, [assumptions([a13, a14])], [c29, c30])). % 131.66/17.15 cnf(c32, plain, % 131.66/17.15 a != X7, % 131.66/17.15 inference(subterm_reduction, [assumptions([a13, a14])], [c29, c30])). % 131.66/17.15 % 131.66/17.15 cnf(a15, assumption, % 131.66/17.15 a = X7). % 131.66/17.15 cnf(c33, plain, % 131.66/17.15 $false, % 131.66/17.15 inference(reflexivity, [assumptions([a15])], [c32])). % 131.66/17.15 % 131.66/17.15 cnf(c34, plain, % 131.66/17.15 $false, % 131.66/17.15 inference(constraint_solving, [ % 131.66/17.15 bind(X0, a), % 131.66/17.15 bind(X1, b), % 131.66/17.15 bind(X2, a), % 131.66/17.15 bind(X3, a), % 131.66/17.15 bind(X4, b), % 131.66/17.15 bind(X5, a), % 131.66/17.15 bind(X6, a), % 131.66/17.15 bind(X7, a) % 131.66/17.15 ], % 131.66/17.15 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])). % 131.66/17.15 % 131.66/17.15 % SZS output end IncompleteProof %------------------------------------------------------------------------------