%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWX186+1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n023.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 : 300s % DateTime : Tue May 5 07:03:21 PM UTC 2026 % Result : Theorem 36.11s 4.97s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWX186+1 : TPTP v9.3.0. Released v9.3.0. % 0.13/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.19/0.34 % Computer : n023.cluster.edu % 0.19/0.34 % Model : x86_64 x86_64 % 0.19/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.19/0.34 % Memory : 8042.1875MB % 0.19/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.19/0.34 % CPULimit : 300 % 0.19/0.34 % WCLimit : 300 % 0.19/0.34 % DateTime : Tue May 5 09:38:23 EDT 2026 % 0.19/0.34 % CPUTime : % 36.11/4.97 % SZS status Theorem % 36.11/4.97 % SZS output begin IncompleteProof % 36.11/4.97 cnf(c0, axiom, % 36.11/4.97 X0 = X1 | drop(X2,X1) != drop(X2,X0)). % 36.11/4.97 cnf(c1, plain, % 36.11/4.97 X0 = X1 | drop(X2,X1) != drop(X2,X0), % 36.11/4.97 inference(start, [], [c0])). % 36.11/4.97 % 36.11/4.97 cnf(c2, axiom, % 36.11/4.97 cons(X3,X4) != nil). % 36.11/4.97 cnf(a0, assumption, % 36.11/4.97 cons(X3,X4) = X1). % 36.11/4.97 cnf(c3, plain, % 36.11/4.97 drop(X2,X1) != drop(X2,X0), % 36.11/4.97 inference(strict_subterm_extension, [assumptions([a0])], [c1, c2])). % 36.11/4.97 cnf(c4, plain, % 36.11/4.97 $false, % 36.11/4.97 inference(strict_subterm_extension, [assumptions([a0])], [c1, c2])). % 36.11/4.97 cnf(c5, plain, % 36.11/4.97 X0 != nil, % 36.11/4.97 inference(strict_subterm_extension, [assumptions([a0])], [c1, c2])). % 36.11/4.97 % 36.11/4.97 cnf(a1, assumption, % 36.11/4.97 X0 = nil). % 36.11/4.97 cnf(c6, plain, % 36.11/4.97 $false, % 36.11/4.97 inference(reflexivity, [assumptions([a1])], [c5])). % 36.11/4.97 % 36.11/4.97 cnf(c7, axiom, % 36.11/4.97 drop(s(X5),cons(X6,X7)) = drop(X5,X7)). % 36.11/4.97 cnf(a2, assumption, % 36.11/4.97 drop(X2,X1) = drop(s(X5),cons(X6,X7))). % 36.11/4.97 cnf(c8, plain, % 36.11/4.97 $false, % 36.11/4.97 inference(strict_function_extension, [assumptions([a2])], [c3, c7])). % 36.11/4.97 cnf(c9, plain, % 36.11/4.97 $false, % 36.11/4.97 inference(strict_function_extension, [assumptions([a2])], [c3, c7])). % 36.11/4.97 cnf(c10, plain, % 36.11/4.97 X8 != drop(X5,X7) | X8 != drop(X2,X0), % 36.11/4.97 inference(strict_function_extension, [assumptions([a2])], [c3, c7])). % 36.11/4.97 % 36.11/4.97 cnf(c11, axiom, % 36.11/4.97 drop(z,X9) = X9). % 36.11/4.97 cnf(a3, assumption, % 36.11/4.97 drop(X5,X7) = drop(z,X9)). % 36.11/4.97 cnf(c12, plain, % 36.11/4.97 X8 != drop(X2,X0), % 36.11/4.97 inference(strict_function_extension, [assumptions([a3])], [c10, c11])). % 36.11/4.97 cnf(c13, plain, % 36.11/4.97 $false, % 36.11/4.97 inference(strict_function_extension, [assumptions([a3])], [c10, c11])). % 36.11/4.97 cnf(c14, plain, % 36.11/4.97 X10 != X9 | X8 != X10, % 36.11/4.97 inference(strict_function_extension, [assumptions([a3])], [c10, c11])). % 36.11/4.97 % 36.11/4.97 cnf(a4, assumption, % 36.11/4.97 X10 = X9). % 36.11/4.97 cnf(c15, plain, % 36.11/4.97 X8 != X10, % 36.11/4.97 inference(reflexivity, [assumptions([a4])], [c14])). % 36.11/4.97 % 36.11/4.97 cnf(a5, assumption, % 36.11/4.97 X8 = X10). % 36.11/4.97 cnf(c16, plain, % 36.11/4.97 $false, % 36.11/4.97 inference(reflexivity, [assumptions([a5])], [c15])). % 36.11/4.97 % 36.11/4.97 cnf(a6, assumption, % 36.11/4.97 X8 = drop(X2,X0)). % 36.11/4.97 cnf(c17, plain, % 36.11/4.97 $false, % 36.11/4.97 inference(reflexivity, [assumptions([a6])], [c12])). % 36.11/4.97 % 36.11/4.97 cnf(c18, plain, % 36.11/4.97 $false, % 36.11/4.97 inference(constraint_solving, [ % 36.11/4.97 bind(X0, nil), % 36.11/4.97 bind(X1, cons(X3,X4)), % 36.11/4.97 bind(X2, s(X5)), % 36.11/4.97 bind(X3, X6), % 36.11/4.97 bind(X4, drop(X2,X0)), % 36.11/4.97 bind(X5, z), % 36.11/4.97 bind(X6, X6), % 36.11/4.97 bind(X7, drop(X2,X0)), % 36.11/4.97 bind(X8, drop(X2,X0)), % 36.11/4.97 bind(X9, drop(X2,X0)), % 36.11/4.97 bind(X10, drop(X2,X0)) % 36.11/4.97 ], % 36.11/4.97 [a0, a1, a2, a3, a4, a5, a6])). % 36.11/4.97 % 36.11/4.97 % SZS output end IncompleteProof %------------------------------------------------------------------------------