%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SYN080+1 : TPTP v8.1.0. Released v2.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 : n015.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:58 EDT 2022 % Result : Theorem 0.12s 0.33s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SYN080+1 : TPTP v8.1.0. Released v2.0.0. % 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n015.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 : Mon Jul 11 18:47:54 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.33 % SZS status Theorem % 0.12/0.33 % SZS output begin IncompleteProof % 0.12/0.33 cnf(c0, axiom, % 0.12/0.33 f(f(sK0)) != f(g(sK1))). % 0.12/0.33 cnf(c1, plain, % 0.12/0.33 f(f(sK0)) != f(g(sK1)), % 0.12/0.33 inference(start, [], [c0])). % 0.12/0.33 % 0.12/0.33 cnf(c2, axiom, % 0.12/0.33 f(X0) = g(X1)). % 0.12/0.33 cnf(a0, assumption, % 0.12/0.33 g(sK1) = g(X1)). % 0.12/0.33 cnf(c3, plain, % 0.12/0.33 $false, % 0.12/0.33 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.33 cnf(c4, plain, % 0.12/0.33 $false, % 0.12/0.33 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.33 cnf(c5, plain, % 0.12/0.33 X2 != f(X0) | f(f(sK0)) != f(X2), % 0.12/0.33 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.33 % 0.12/0.33 cnf(a1, assumption, % 0.12/0.33 X2 = f(X0)). % 0.12/0.33 cnf(c6, plain, % 0.12/0.33 f(f(sK0)) != f(X2), % 0.12/0.33 inference(reflexivity, [assumptions([a1])], [c5])). % 0.12/0.33 % 0.12/0.33 cnf(a2, assumption, % 0.12/0.33 f(f(sK0)) = f(X2)). % 0.12/0.33 cnf(c7, plain, % 0.12/0.33 $false, % 0.12/0.33 inference(reflexivity, [assumptions([a2])], [c6])). % 0.12/0.33 % 0.12/0.33 cnf(c8, plain, % 0.12/0.33 $false, % 0.12/0.33 inference(constraint_solving, [ % 0.12/0.33 bind(X0, sK0), % 0.12/0.33 bind(X1, sK1), % 0.12/0.33 bind(X2, f(X0)) % 0.12/0.33 ], % 0.12/0.33 [a0, a1, a2])). % 0.12/0.33 % 0.12/0.33 % SZS output end IncompleteProof %------------------------------------------------------------------------------