%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL682+1.001 : TPTP v9.3.1. 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 : n014.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Sep 7 12:29:10 PM UTC 2026 % Result : Theorem 0.09s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL682+1.001 : TPTP v9.3.1. Released v4.0.0. % 0.00/0.03 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.09/0.36 % Computer : n014.cluster.edu % 0.09/0.36 % Model : x86_64 x86_64 % 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.36 % Memory : 8046.5625MB % 0.09/0.36 % OS : Linux 6.8.0-71-generic % 0.09/0.36 % CPULimit : 300 % 0.09/0.36 % WCLimit : 300 % 0.09/0.36 % DateTime : Fri Sep 4 16:06:13 UTC 2026 % 0.09/0.36 % CPUTime : % 0.09/0.37 % SZS status Theorem % 0.09/0.37 % SZS output begin IncompleteProof % 0.09/0.37 cnf(c0, axiom, % 0.09/0.37 ~p12(sK5)). % 0.09/0.37 cnf(c1, plain, % 0.09/0.37 ~p12(sK5), % 0.09/0.37 inference(start, [], [c0])). % 0.09/0.37 % 0.09/0.37 cnf(c2, axiom, % 0.09/0.37 p12(X0) | ~r1(X1,X0) | ~sP0(X1)). % 0.09/0.37 cnf(a0, assumption, % 0.09/0.37 sK5 = X0). % 0.09/0.37 cnf(c3, plain, % 0.09/0.37 $false, % 0.09/0.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.09/0.37 cnf(c4, plain, % 0.09/0.37 ~r1(X1,X0) | ~sP0(X1), % 0.09/0.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.09/0.37 % 0.09/0.37 cnf(c5, axiom, % 0.09/0.37 r1(sK4,sK5)). % 0.09/0.37 cnf(a1, assumption, % 0.09/0.37 X1 = sK4). % 0.09/0.37 cnf(a2, assumption, % 0.09/0.37 X0 = sK5). % 0.09/0.37 cnf(c6, plain, % 0.09/0.37 ~sP0(X1), % 0.09/0.37 inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])). % 0.09/0.37 cnf(c7, plain, % 0.09/0.37 $false, % 0.09/0.37 inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])). % 0.09/0.37 % 0.09/0.37 cnf(c8, axiom, % 0.09/0.37 sP0(X2) | ~r1(sK1,X2)). % 0.09/0.37 cnf(a3, assumption, % 0.09/0.37 X1 = X2). % 0.09/0.37 cnf(c9, plain, % 0.09/0.37 $false, % 0.09/0.37 inference(strict_predicate_extension, [assumptions([a3])], [c6, c8])). % 0.09/0.37 cnf(c10, plain, % 0.09/0.37 ~r1(sK1,X2), % 0.09/0.37 inference(strict_predicate_extension, [assumptions([a3])], [c6, c8])). % 0.09/0.37 % 0.09/0.37 cnf(c11, axiom, % 0.09/0.37 r1(sK1,sK4)). % 0.09/0.37 cnf(a4, assumption, % 0.09/0.37 sK1 = sK1). % 0.09/0.37 cnf(a5, assumption, % 0.09/0.37 X2 = sK4). % 0.09/0.37 cnf(c12, plain, % 0.09/0.37 $false, % 0.09/0.37 inference(strict_predicate_extension, [assumptions([a4, a5])], [c10, c11])). % 0.09/0.37 cnf(c13, plain, % 0.09/0.37 $false, % 0.09/0.37 inference(strict_predicate_extension, [assumptions([a4, a5])], [c10, c11])). % 0.09/0.37 % 0.09/0.37 cnf(c14, plain, % 0.09/0.37 $false, % 0.09/0.37 inference(constraint_solving, [ % 0.09/0.37 bind(X0, sK5), % 0.09/0.37 bind(X1, sK4), % 0.09/0.37 bind(X2, sK4) % 0.09/0.37 ], % 0.09/0.37 [a0, a1, a2, a3, a4, a5])). % 0.09/0.37 % 0.09/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------