%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL684+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 : n012.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:11 PM UTC 2026 % Result : Theorem 0.07s 0.32s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL684+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.07/0.31 % Computer : n012.cluster.edu % 0.07/0.31 % Model : x86_64 x86_64 % 0.07/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.31 % Memory : 8046.5625MB % 0.07/0.31 % OS : Linux 6.8.0-71-generic % 0.07/0.32 % CPULimit : 300 % 0.07/0.32 % WCLimit : 300 % 0.07/0.32 % DateTime : Sat Sep 5 16:33:12 UTC 2026 % 0.07/0.32 % CPUTime : % 0.07/0.32 % SZS status Theorem % 0.07/0.32 % SZS output begin IncompleteProof % 0.07/0.32 cnf(c0, axiom, % 0.07/0.32 p101(sK0)). % 0.07/0.32 cnf(c1, plain, % 0.07/0.32 p101(sK0), % 0.07/0.32 inference(start, [], [c0])). % 0.07/0.32 % 0.07/0.32 cnf(c2, axiom, % 0.07/0.32 ~p101(X0) | ~p201(X0) | ~r1(X1,X0) | ~r1(sK0,X1)). % 0.07/0.32 cnf(a0, assumption, % 0.07/0.32 sK0 = X0). % 0.07/0.32 cnf(c3, plain, % 0.07/0.32 $false, % 0.07/0.32 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.07/0.32 cnf(c4, plain, % 0.07/0.32 ~p201(X0) | ~r1(X1,X0) | ~r1(sK0,X1), % 0.07/0.32 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.07/0.32 % 0.07/0.32 cnf(c5, axiom, % 0.07/0.32 p201(sK0)). % 0.07/0.32 cnf(a1, assumption, % 0.07/0.32 X0 = sK0). % 0.07/0.32 cnf(c6, plain, % 0.07/0.32 ~r1(X1,X0) | ~r1(sK0,X1), % 0.07/0.32 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.07/0.32 cnf(c7, plain, % 0.07/0.32 $false, % 0.07/0.32 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.07/0.32 % 0.07/0.32 cnf(c8, axiom, % 0.07/0.32 r1(X2,X2)). % 0.07/0.32 cnf(a2, assumption, % 0.07/0.32 X1 = X2). % 0.07/0.32 cnf(a3, assumption, % 0.07/0.32 X0 = X2). % 0.07/0.32 cnf(c9, plain, % 0.07/0.32 ~r1(sK0,X1), % 0.07/0.32 inference(strict_predicate_extension, [assumptions([a2, a3])], [c6, c8])). % 0.07/0.32 cnf(c10, plain, % 0.07/0.32 $false, % 0.07/0.32 inference(strict_predicate_extension, [assumptions([a2, a3])], [c6, c8])). % 0.07/0.32 % 0.07/0.32 cnf(c11, plain, % 0.07/0.32 r1(X1,X0)). % 0.07/0.32 cnf(a4, assumption, % 0.07/0.32 sK0 = X1). % 0.07/0.32 cnf(a5, assumption, % 0.07/0.32 X1 = X0). % 0.07/0.32 cnf(c12, plain, % 0.07/0.32 $false, % 0.07/0.32 inference(predicate_reduction, [assumptions([a4, a5])], [c9, c11])). % 0.07/0.32 % 0.07/0.32 cnf(c13, plain, % 0.07/0.32 $false, % 0.07/0.32 inference(constraint_solving, [ % 0.07/0.32 bind(X0, sK0), % 0.07/0.32 bind(X1, sK0), % 0.07/0.32 bind(X2, sK0) % 0.07/0.32 ], % 0.07/0.32 [a0, a1, a2, a3, a4, a5])). % 0.07/0.32 % 0.07/0.32 % SZS output end IncompleteProof %------------------------------------------------------------------------------