%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SYN082-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 : 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 : Thu Jul 21 08:07:59 EDT 2022 % Result : Unsatisfiable 0.12s 0.34s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : SYN082-1 : TPTP v8.1.0. Released v1.0.0. % 0.11/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n028.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 : Tue Jul 12 06:26:44 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 ~big_f(a,f(a)) | ~big_f(a,X0) | ~big_f(g(X0),X0)). % 0.12/0.34 cnf(c1, plain, % 0.12/0.34 ~big_f(a,f(a)) | ~big_f(a,X0) | ~big_f(g(X0),X0), % 0.12/0.34 inference(start, [], [c0])). % 0.12/0.34 % 0.12/0.34 cnf(c2, axiom, % 0.12/0.34 big_f(a,b) | big_f(a,f(a))). % 0.12/0.34 cnf(a0, assumption, % 0.12/0.34 a = a). % 0.12/0.34 cnf(a1, assumption, % 0.12/0.34 f(a) = f(a)). % 0.12/0.34 cnf(c3, plain, % 0.12/0.34 ~big_f(a,X0) | ~big_f(g(X0),X0), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.34 cnf(c4, plain, % 0.12/0.34 big_f(a,b), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.34 % 0.12/0.34 cnf(c5, axiom, % 0.12/0.34 big_f(X1,f(a)) | ~big_f(X1,b) | big_f(a,f(a))). % 0.12/0.34 cnf(a2, assumption, % 0.12/0.34 a = X1). % 0.12/0.34 cnf(a3, assumption, % 0.12/0.34 b = b). % 0.12/0.34 cnf(c6, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.12/0.34 cnf(c7, plain, % 0.12/0.34 big_f(X1,f(a)) | big_f(a,f(a)), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.12/0.34 % 0.12/0.34 cnf(c8, plain, % 0.12/0.34 ~big_f(a,f(a))). % 0.12/0.34 cnf(a4, assumption, % 0.12/0.34 X1 = a). % 0.12/0.34 cnf(a5, assumption, % 0.12/0.34 f(a) = f(a)). % 0.12/0.34 cnf(c9, plain, % 0.12/0.34 big_f(a,f(a)), % 0.12/0.34 inference(predicate_reduction, [assumptions([a4, a5])], [c7, c8])). % 0.12/0.34 % 0.12/0.34 cnf(c10, plain, % 0.12/0.34 ~big_f(a,f(a))). % 0.12/0.34 cnf(a6, assumption, % 0.12/0.34 a = a). % 0.12/0.34 cnf(a7, assumption, % 0.12/0.34 f(a) = f(a)). % 0.12/0.34 cnf(c11, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(predicate_reduction, [assumptions([a6, a7])], [c9, c10])). % 0.12/0.34 % 0.12/0.34 cnf(c12, plain, % 0.12/0.34 big_f(a,f(a))). % 0.12/0.34 cnf(a8, assumption, % 0.12/0.34 a = a). % 0.12/0.34 cnf(a9, assumption, % 0.12/0.34 X0 = f(a)). % 0.12/0.34 cnf(c13, plain, % 0.12/0.34 ~big_f(g(X0),X0), % 0.12/0.34 inference(predicate_reduction, [assumptions([a8, a9])], [c3, c12])). % 0.12/0.34 % 0.12/0.34 cnf(c14, axiom, % 0.12/0.34 ~big_f(a,f(a)) | ~big_f(a,X2) | big_f(g(X2),X2)). % 0.12/0.34 cnf(a10, assumption, % 0.12/0.34 g(X0) = g(X2)). % 0.12/0.34 cnf(a11, assumption, % 0.12/0.34 X0 = X2). % 0.12/0.34 cnf(c15, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a10, a11])], [c13, c14])). % 0.12/0.34 cnf(c16, plain, % 0.12/0.34 ~big_f(a,f(a)) | ~big_f(a,X2), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a10, a11])], [c13, c14])). % 0.12/0.34 % 0.12/0.34 cnf(c17, plain, % 0.12/0.34 big_f(a,f(a))). % 0.12/0.34 cnf(a12, assumption, % 0.12/0.34 a = a). % 0.12/0.34 cnf(a13, assumption, % 0.12/0.34 f(a) = f(a)). % 0.12/0.34 cnf(c18, plain, % 0.12/0.34 ~big_f(a,X2), % 0.12/0.34 inference(predicate_reduction, [assumptions([a12, a13])], [c16, c17])). % 0.12/0.34 % 0.12/0.34 cnf(c19, plain, % 0.12/0.34 big_f(a,f(a))). % 0.12/0.34 cnf(a14, assumption, % 0.12/0.34 a = a). % 0.12/0.34 cnf(a15, assumption, % 0.12/0.34 X2 = f(a)). % 0.12/0.34 cnf(c20, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(predicate_reduction, [assumptions([a14, a15])], [c18, c19])). % 0.12/0.34 % 0.12/0.34 cnf(c21, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(constraint_solving, [ % 0.12/0.34 bind(X0, f(a)), % 0.12/0.34 bind(X1, a), % 0.12/0.34 bind(X2, f(a)) % 0.12/0.34 ], % 0.12/0.34 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])). % 0.12/0.34 % 0.12/0.34 % SZS output end IncompleteProof %------------------------------------------------------------------------------