TSTP Solution File: KLE137+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : KLE137+1 : 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 : n020.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 : Sun Jul 17 02:09:38 EDT 2022
% Result : Theorem 54.18s 7.33s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : KLE137+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 16 08:42:19 EDT 2022
% 0.13/0.35 % CPUTime :
% 54.18/7.33 % SZS status Theorem
% 54.18/7.33 % SZS output begin IncompleteProof
% 54.18/7.33 cnf(c0, axiom,
% 54.18/7.33 ~leq(sK0,strong_iteration(one))).
% 54.18/7.33 cnf(c1, plain,
% 54.18/7.33 ~leq(sK0,strong_iteration(one)),
% 54.18/7.33 inference(start, [], [c0])).
% 54.18/7.33
% 54.18/7.33 cnf(c2, axiom,
% 54.18/7.33 leq(X0,multiplication(strong_iteration(X1),X2)) | ~leq(X0,addition(multiplication(X1,X0),X2))).
% 54.18/7.33 cnf(a0, assumption,
% 54.18/7.33 X3 = sK0).
% 54.18/7.33 cnf(a1, assumption,
% 54.18/7.33 X4 = strong_iteration(one)).
% 54.18/7.33 cnf(c3, plain,
% 54.18/7.33 $false,
% 54.18/7.33 inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 54.18/7.33 cnf(c4, plain,
% 54.18/7.33 ~leq(X0,addition(multiplication(X1,X0),X2)),
% 54.18/7.33 inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 54.18/7.33 cnf(c5, plain,
% 54.18/7.33 X0 != X3 | multiplication(strong_iteration(X1),X2) != X4,
% 54.18/7.33 inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 54.18/7.33
% 54.18/7.33 cnf(a2, assumption,
% 54.18/7.33 X0 = X3).
% 54.18/7.33 cnf(c6, plain,
% 54.18/7.33 multiplication(strong_iteration(X1),X2) != X4,
% 54.18/7.33 inference(reflexivity, [assumptions([a2])], [c5])).
% 54.18/7.33
% 54.18/7.33 cnf(c7, axiom,
% 54.18/7.33 multiplication(X5,one) = X5).
% 54.18/7.33 cnf(a3, assumption,
% 54.18/7.33 multiplication(strong_iteration(X1),X2) = multiplication(X5,one)).
% 54.18/7.33 cnf(c8, plain,
% 54.18/7.33 $false,
% 54.18/7.33 inference(strict_function_extension, [assumptions([a3])], [c6, c7])).
% 54.18/7.33 cnf(c9, plain,
% 54.18/7.33 $false,
% 54.18/7.33 inference(strict_function_extension, [assumptions([a3])], [c6, c7])).
% 54.18/7.33 cnf(c10, plain,
% 54.18/7.33 X6 != X5 | X6 != X4,
% 54.18/7.33 inference(strict_function_extension, [assumptions([a3])], [c6, c7])).
% 54.18/7.33
% 54.18/7.33 cnf(a4, assumption,
% 54.18/7.33 X6 = X5).
% 54.18/7.33 cnf(c11, plain,
% 54.18/7.33 X6 != X4,
% 54.18/7.33 inference(reflexivity, [assumptions([a4])], [c10])).
% 54.18/7.33
% 54.18/7.33 cnf(a5, assumption,
% 54.18/7.33 X6 = X4).
% 54.18/7.33 cnf(c12, plain,
% 54.18/7.33 $false,
% 54.18/7.33 inference(reflexivity, [assumptions([a5])], [c11])).
% 54.18/7.33
% 54.18/7.33 cnf(c13, axiom,
% 54.18/7.33 multiplication(one,X7) = X7).
% 54.18/7.33 cnf(a6, assumption,
% 54.18/7.33 multiplication(X1,X0) = multiplication(one,X7)).
% 54.18/7.33 cnf(c14, plain,
% 54.18/7.33 $false,
% 54.18/7.33 inference(strict_function_extension, [assumptions([a6])], [c4, c13])).
% 54.18/7.33 cnf(c15, plain,
% 54.18/7.33 $false,
% 54.18/7.33 inference(strict_function_extension, [assumptions([a6])], [c4, c13])).
% 54.18/7.33 cnf(c16, plain,
% 54.18/7.33 X8 != X7 | ~leq(X0,addition(X8,X2)),
% 54.18/7.33 inference(strict_function_extension, [assumptions([a6])], [c4, c13])).
% 54.18/7.33
% 54.18/7.33 cnf(a7, assumption,
% 54.18/7.33 X8 = X7).
% 54.18/7.33 cnf(c17, plain,
% 54.18/7.33 ~leq(X0,addition(X8,X2)),
% 54.18/7.33 inference(reflexivity, [assumptions([a7])], [c16])).
% 54.18/7.33
% 54.18/7.33 cnf(c18, axiom,
% 54.18/7.33 leq(X9,X10) | addition(X9,X10) != X10).
% 54.18/7.33 cnf(a8, assumption,
% 54.18/7.33 X0 = X9).
% 54.18/7.33 cnf(a9, assumption,
% 54.18/7.33 addition(X8,X2) = X10).
% 54.18/7.33 cnf(c19, plain,
% 54.18/7.33 $false,
% 54.18/7.33 inference(strict_predicate_extension, [assumptions([a8, a9])], [c17, c18])).
% 54.18/7.33 cnf(c20, plain,
% 54.18/7.33 addition(X9,X10) != X10,
% 54.18/7.33 inference(strict_predicate_extension, [assumptions([a8, a9])], [c17, c18])).
% 54.18/7.33
% 54.18/7.33 cnf(c21, axiom,
% 54.18/7.33 addition(X11,addition(X12,X13)) = addition(addition(X11,X12),X13)).
% 54.18/7.33 cnf(a10, assumption,
% 54.18/7.33 addition(X9,X10) = addition(X11,addition(X12,X13))).
% 54.18/7.33 cnf(c22, plain,
% 54.18/7.33 $false,
% 54.18/7.33 inference(strict_function_extension, [assumptions([a10])], [c20, c21])).
% 54.18/7.33 cnf(c23, plain,
% 54.18/7.33 $false,
% 54.18/7.33 inference(strict_function_extension, [assumptions([a10])], [c20, c21])).
% 54.18/7.33 cnf(c24, plain,
% 54.18/7.33 X14 != addition(addition(X11,X12),X13) | X14 != X10,
% 54.18/7.33 inference(strict_function_extension, [assumptions([a10])], [c20, c21])).
% 54.18/7.33
% 54.18/7.33 cnf(c25, axiom,
% 54.18/7.33 addition(X15,X15) = X15).
% 54.18/7.33 cnf(a11, assumption,
% 54.18/7.33 addition(X11,X12) = addition(X15,X15)).
% 54.18/7.33 cnf(c26, plain,
% 54.18/7.33 X14 != X10,
% 54.18/7.33 inference(strict_function_extension, [assumptions([a11])], [c24, c25])).
% 54.18/7.33 cnf(c27, plain,
% 54.18/7.33 $false,
% 54.18/7.33 inference(strict_function_extension, [assumptions([a11])], [c24, c25])).
% 54.18/7.33 cnf(c28, plain,
% 54.18/7.33 X16 != X15 | X14 != addition(X16,X13),
% 54.18/7.33 inference(strict_function_extension, [assumptions([a11])], [c24, c25])).
% 54.18/7.33
% 54.18/7.33 cnf(a12, assumption,
% 54.18/7.33 X16 = X15).
% 54.18/7.33 cnf(c29, plain,
% 54.18/7.33 X14 != addition(X16,X13),
% 54.18/7.33 inference(reflexivity, [assumptions([a12])], [c28])).
% 54.18/7.33
% 54.18/7.33 cnf(a13, assumption,
% 54.18/7.33 X14 = addition(X16,X13)).
% 54.18/7.33 cnf(c30, plain,
% 54.18/7.33 $false,
% 54.18/7.33 inference(reflexivity, [assumptions([a13])], [c29])).
% 54.18/7.33
% 54.18/7.33 cnf(a14, assumption,
% 54.18/7.33 X14 = X10).
% 54.18/7.33 cnf(c31, plain,
% 54.18/7.33 $false,
% 54.18/7.33 inference(reflexivity, [assumptions([a14])], [c26])).
% 54.18/7.33
% 54.18/7.33 cnf(c32, plain,
% 54.18/7.33 $false,
% 54.18/7.33 inference(constraint_solving, [
% 54.18/7.33 bind(X0, sK0),
% 54.18/7.33 bind(X1, one),
% 54.18/7.33 bind(X2, one),
% 54.18/7.33 bind(X3, sK0),
% 54.18/7.33 bind(X4, strong_iteration(one)),
% 54.18/7.33 bind(X5, strong_iteration(X1)),
% 54.18/7.33 bind(X6, strong_iteration(X1)),
% 54.18/7.33 bind(X7, sK0),
% 54.18/7.33 bind(X8, sK0),
% 54.18/7.33 bind(X9, sK0),
% 54.18/7.33 bind(X10, addition(X8,X2)),
% 54.18/7.33 bind(X11, sK0),
% 54.18/7.33 bind(X12, sK0),
% 54.18/7.33 bind(X13, one),
% 54.18/7.33 bind(X14, addition(X16,X13)),
% 54.18/7.33 bind(X15, sK0),
% 54.18/7.33 bind(X16, sK0)
% 54.18/7.33 ],
% 54.18/7.33 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14])).
% 54.18/7.33
% 54.18/7.33 % SZS output end IncompleteProof
%------------------------------------------------------------------------------