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