%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SYN986+1.001 : TPTP v8.1.0. Released v4.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 : n006.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:14:35 EDT 2022 % Result : Theorem 0.14s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.14 % Problem : SYN986+1.001 : TPTP v8.1.0. Released v4.0.0. % 0.08/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.36 % Computer : n006.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Mon Jul 11 23:20:05 EDT 2022 % 0.14/0.36 % CPUTime : % 0.14/0.37 % SZS status Theorem % 0.14/0.37 % SZS output begin IncompleteProof % 0.14/0.37 cnf(c0, axiom, % 0.14/0.37 ~r(zero,X0,X1) | ~r(zero,zero,X0)). % 0.14/0.37 cnf(c1, plain, % 0.14/0.37 ~r(zero,X0,X1) | ~r(zero,zero,X0), % 0.14/0.37 inference(start, [], [c0])). % 0.14/0.37 % 0.14/0.37 cnf(c2, axiom, % 0.14/0.37 r(X2,succ(X3),X4) | ~r(X5,X3,X4) | ~r(X2,X3,X5)). % 0.14/0.37 cnf(a0, assumption, % 0.14/0.37 zero = X2). % 0.14/0.37 cnf(a1, assumption, % 0.14/0.37 X0 = succ(X3)). % 0.14/0.37 cnf(a2, assumption, % 0.14/0.37 X1 = X4). % 0.14/0.37 cnf(c3, plain, % 0.14/0.37 ~r(zero,zero,X0), % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.14/0.37 cnf(c4, plain, % 0.14/0.37 ~r(X5,X3,X4) | ~r(X2,X3,X5), % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.14/0.37 % 0.14/0.37 cnf(c5, axiom, % 0.14/0.37 r(X6,zero,succ(X6))). % 0.14/0.37 cnf(a3, assumption, % 0.14/0.37 X5 = X6). % 0.14/0.37 cnf(a4, assumption, % 0.14/0.37 X3 = zero). % 0.14/0.37 cnf(a5, assumption, % 0.14/0.37 X4 = succ(X6)). % 0.14/0.37 cnf(c6, plain, % 0.14/0.37 ~r(X2,X3,X5), % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])). % 0.14/0.37 cnf(c7, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])). % 0.14/0.37 % 0.14/0.37 cnf(c8, axiom, % 0.14/0.37 r(X7,zero,succ(X7))). % 0.14/0.37 cnf(a6, assumption, % 0.14/0.37 X2 = X7). % 0.14/0.37 cnf(a7, assumption, % 0.14/0.37 X3 = zero). % 0.14/0.37 cnf(a8, assumption, % 0.14/0.37 X5 = succ(X7)). % 0.14/0.37 cnf(c9, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c6, c8])). % 0.14/0.37 cnf(c10, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c6, c8])). % 0.14/0.37 % 0.14/0.37 cnf(c11, plain, % 0.14/0.37 r(X2,X3,X5)). % 0.14/0.37 cnf(a9, assumption, % 0.14/0.37 zero = X2). % 0.14/0.37 cnf(a10, assumption, % 0.14/0.37 zero = X3). % 0.14/0.37 cnf(a11, assumption, % 0.14/0.37 X0 = X5). % 0.14/0.37 cnf(c12, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(predicate_reduction, [assumptions([a9, a10, a11])], [c3, c11])). % 0.14/0.37 % 0.14/0.37 cnf(c13, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(constraint_solving, [ % 0.14/0.37 bind(X0, succ(X3)), % 0.14/0.37 bind(X1, succ(X6)), % 0.14/0.37 bind(X2, zero), % 0.14/0.37 bind(X3, zero), % 0.14/0.37 bind(X4, succ(X6)), % 0.14/0.37 bind(X5, succ(X7)), % 0.14/0.37 bind(X6, succ(X7)), % 0.14/0.37 bind(X7, zero) % 0.14/0.37 ], % 0.14/0.37 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])). % 0.14/0.37 % 0.14/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------