%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SYN075-1 : 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 : n011.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 : Thu Jul 21 08:07:54 EDT 2022 % Result : Unsatisfiable 20.08s 2.91s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : SYN075-1 : TPTP v8.1.0. Released v1.0.0. % 0.12/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.34 % Computer : n011.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Tue Jul 12 04:00:28 EDT 2022 % 0.12/0.34 % CPUTime : % 20.08/2.91 % SZS status Unsatisfiable % 20.08/2.91 % SZS output begin IncompleteProof % 20.08/2.91 cnf(c0, axiom, % 20.08/2.91 f(X0) = X0 | big_f(g(X0),f(X0))). % 20.08/2.91 cnf(c1, plain, % 20.08/2.91 f(X0) = X0 | big_f(g(X0),f(X0)), % 20.08/2.91 inference(start, [], [c0])). % 20.08/2.91 % 20.08/2.91 cnf(c2, axiom, % 20.08/2.91 h(X1,X2) = X2 | big_f(h(X1,X2),f(X1)) | f(X1) != X1). % 20.08/2.91 cnf(a0, assumption, % 20.08/2.91 f(X1) = f(X0)). % 20.08/2.91 cnf(c3, plain, % 20.08/2.91 big_f(g(X0),f(X0)), % 20.08/2.91 inference(strict_subterm_extension, [assumptions([a0])], [c1, c2])). % 20.08/2.91 cnf(c4, plain, % 20.08/2.91 h(X1,X2) = X2 | big_f(h(X1,X2),f(X1)), % 20.08/2.91 inference(strict_subterm_extension, [assumptions([a0])], [c1, c2])). % 20.08/2.91 cnf(c5, plain, % 20.08/2.91 X0 != X1, % 20.08/2.91 inference(strict_subterm_extension, [assumptions([a0])], [c1, c2])). % 20.08/2.91 % 20.08/2.91 cnf(a1, assumption, % 20.08/2.91 X0 = X1). % 20.08/2.91 cnf(c6, plain, % 20.08/2.91 $false, % 20.08/2.91 inference(reflexivity, [assumptions([a1])], [c5])). % 20.08/2.91 % 20.08/2.91 cnf(c7, axiom, % 20.08/2.91 ~big_f(h(X3,X4),f(X3)) | h(X3,X4) != X4 | f(X3) != X3). % 20.08/2.91 cnf(a2, assumption, % 20.08/2.91 h(X3,X4) = h(X1,X2)). % 20.08/2.91 cnf(c8, plain, % 20.08/2.91 big_f(h(X1,X2),f(X1)), % 20.08/2.91 inference(strict_subterm_extension, [assumptions([a2])], [c4, c7])). % 20.08/2.91 cnf(c9, plain, % 20.08/2.91 h(X3,X4) != X4 | f(X3) != X3, % 20.08/2.91 inference(strict_subterm_extension, [assumptions([a2])], [c4, c7])). % 20.08/2.91 cnf(c10, plain, % 20.08/2.91 ~big_f(X2,f(X3)), % 20.08/2.91 inference(strict_subterm_extension, [assumptions([a2])], [c4, c7])). % 20.08/2.91 % 20.08/2.91 cnf(c11, plain, % 20.08/2.91 f(X0) = X0). % 20.08/2.91 cnf(a3, assumption, % 20.08/2.91 f(X3) = f(X0)). % 20.08/2.91 cnf(c12, plain, % 20.08/2.91 $false, % 20.08/2.91 inference(equality_reduction, [assumptions([a3])], [c10, c11])). % 20.08/2.91 cnf(c13, plain, % 20.08/2.91 ~big_f(X2,X0), % 20.08/2.91 inference(equality_reduction, [assumptions([a3])], [c10, c11])). % 20.08/2.91 % 20.08/2.91 cnf(c14, axiom, % 20.08/2.91 big_f(a,b)). % 20.08/2.91 cnf(a4, assumption, % 20.08/2.91 X2 = a). % 20.08/2.91 cnf(a5, assumption, % 20.08/2.91 X0 = b). % 20.08/2.91 cnf(c15, plain, % 20.08/2.91 $false, % 20.08/2.91 inference(strict_predicate_extension, [assumptions([a4, a5])], [c13, c14])). % 20.08/2.91 cnf(c16, plain, % 20.08/2.91 $false, % 20.08/2.91 inference(strict_predicate_extension, [assumptions([a4, a5])], [c13, c14])). % 20.08/2.91 % 20.08/2.91 cnf(c17, plain, % 20.08/2.91 h(X1,X2) = X2). % 20.08/2.91 cnf(a6, assumption, % 20.08/2.91 h(X3,X4) = h(X1,X2)). % 20.08/2.91 cnf(c18, plain, % 20.08/2.91 f(X3) != X3, % 20.08/2.91 inference(equality_reduction, [assumptions([a6])], [c9, c17])). % 20.08/2.91 cnf(c19, plain, % 20.08/2.91 X2 != X4, % 20.08/2.91 inference(equality_reduction, [assumptions([a6])], [c9, c17])). % 20.08/2.91 % 20.08/2.91 cnf(a7, assumption, % 20.08/2.91 X2 = X4). % 20.08/2.91 cnf(c20, plain, % 20.08/2.91 $false, % 20.08/2.91 inference(reflexivity, [assumptions([a7])], [c19])). % 20.08/2.91 % 20.08/2.91 cnf(c21, plain, % 20.08/2.91 f(X1) = X1). % 20.08/2.91 cnf(a8, assumption, % 20.08/2.91 f(X3) = f(X1)). % 20.08/2.91 cnf(c22, plain, % 20.08/2.91 $false, % 20.08/2.91 inference(equality_reduction, [assumptions([a8])], [c18, c21])). % 20.08/2.91 cnf(c23, plain, % 20.08/2.91 X1 != X3, % 20.08/2.91 inference(equality_reduction, [assumptions([a8])], [c18, c21])). % 20.08/2.91 % 20.08/2.91 cnf(a9, assumption, % 20.08/2.91 X1 = X3). % 20.08/2.91 cnf(c24, plain, % 20.08/2.91 $false, % 20.08/2.91 inference(reflexivity, [assumptions([a9])], [c23])). % 20.08/2.91 % 20.08/2.91 cnf(c25, axiom, % 20.08/2.91 a = X5 | ~big_f(X5,X6)). % 20.08/2.91 cnf(a10, assumption, % 20.08/2.91 h(X1,X2) = X5). % 20.08/2.91 cnf(a11, assumption, % 20.08/2.91 f(X1) = X6). % 20.08/2.91 cnf(c26, plain, % 20.08/2.91 $false, % 20.08/2.91 inference(strict_predicate_extension, [assumptions([a10, a11])], [c8, c25])). % 20.08/2.91 cnf(c27, plain, % 20.08/2.91 a = X5, % 20.08/2.91 inference(strict_predicate_extension, [assumptions([a10, a11])], [c8, c25])). % 20.08/2.91 % 20.08/2.91 cnf(c28, plain, % 20.08/2.91 h(X1,X2) != X2). % 20.08/2.91 cnf(a12, assumption, % 20.08/2.91 h(X1,X2) = X5). % 20.08/2.91 cnf(a13, assumption, % 20.08/2.91 a = X7). % 20.08/2.91 cnf(c29, plain, % 20.08/2.91 $false, % 20.08/2.91 inference(subterm_reduction, [assumptions([a12, a13])], [c27, c28])). % 20.08/2.91 cnf(c30, plain, % 20.08/2.91 X7 != X2, % 20.08/2.91 inference(subterm_reduction, [assumptions([a12, a13])], [c27, c28])). % 20.08/2.91 % 20.08/2.91 cnf(a14, assumption, % 20.08/2.91 X7 = X2). % 20.08/2.91 cnf(c31, plain, % 20.08/2.91 $false, % 20.08/2.91 inference(reflexivity, [assumptions([a14])], [c30])). % 20.08/2.91 % 20.08/2.91 cnf(c32, axiom, % 20.08/2.91 b = X8 | ~big_f(X9,X8)). % 20.08/2.91 cnf(a15, assumption, % 20.08/2.91 g(X0) = X9). % 20.08/2.91 cnf(a16, assumption, % 20.08/2.91 f(X0) = X8). % 20.08/2.91 cnf(c33, plain, % 20.08/2.91 $false, % 20.08/2.91 inference(strict_predicate_extension, [assumptions([a15, a16])], [c3, c32])). % 20.08/2.91 cnf(c34, plain, % 20.08/2.91 b = X8, % 20.08/2.91 inference(strict_predicate_extension, [assumptions([a15, a16])], [c3, c32])). % 20.08/2.91 % 20.08/2.91 cnf(c35, plain, % 20.08/2.91 f(X0) != X0). % 20.08/2.91 cnf(a17, assumption, % 20.08/2.91 f(X0) = X8). % 20.08/2.91 cnf(a18, assumption, % 20.08/2.91 b = X10). % 20.08/2.91 cnf(c36, plain, % 20.08/2.91 $false, % 20.08/2.91 inference(subterm_reduction, [assumptions([a17, a18])], [c34, c35])). % 20.08/2.91 cnf(c37, plain, % 20.08/2.91 X10 != X0, % 20.08/2.91 inference(subterm_reduction, [assumptions([a17, a18])], [c34, c35])). % 20.08/2.91 % 20.08/2.91 cnf(a19, assumption, % 20.08/2.91 X10 = X0). % 20.08/2.91 cnf(c38, plain, % 20.08/2.91 $false, % 20.08/2.91 inference(reflexivity, [assumptions([a19])], [c37])). % 20.08/2.91 % 20.08/2.91 cnf(c39, plain, % 20.08/2.91 $false, % 20.08/2.91 inference(constraint_solving, [ % 20.08/2.91 bind(X0, b), % 20.08/2.91 bind(X1, b), % 20.08/2.91 bind(X2, a), % 20.08/2.91 bind(X3, b), % 20.08/2.91 bind(X4, a), % 20.08/2.91 bind(X5, h(X1,X2)), % 20.08/2.91 bind(X6, f(X1)), % 20.08/2.91 bind(X7, a), % 20.08/2.91 bind(X8, f(X0)), % 20.08/2.91 bind(X9, g(X0)), % 20.08/2.91 bind(X10, b) % 20.08/2.91 ], % 20.08/2.91 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19])). % 20.08/2.91 % 20.08/2.91 % SZS output end IncompleteProof %------------------------------------------------------------------------------