TSTP Solution File: KLE150+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : KLE150+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 : 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 : 600s
% DateTime : Sun Jul 17 02:09:43 EDT 2022
% Result : Theorem 8.05s 1.39s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.13 % Problem : KLE150+1 : TPTP v8.1.0. Released v4.0.0.
% 0.05/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n023.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 07:39:35 EDT 2022
% 0.13/0.35 % CPUTime :
% 8.05/1.39 % SZS status Theorem
% 8.05/1.39 % SZS output begin IncompleteProof
% 8.05/1.39 cnf(c0, axiom,
% 8.05/1.39 strong_iteration(multiplication(sK0,zero)) != addition(one,multiplication(sK0,zero))).
% 8.05/1.39 cnf(c1, plain,
% 8.05/1.39 strong_iteration(multiplication(sK0,zero)) != addition(one,multiplication(sK0,zero)),
% 8.05/1.39 inference(start, [], [c0])).
% 8.05/1.39
% 8.05/1.39 cnf(c2, axiom,
% 8.05/1.39 addition(X0,X1) = addition(X1,X0)).
% 8.05/1.39 cnf(a0, assumption,
% 8.05/1.39 addition(one,multiplication(sK0,zero)) = addition(X1,X0)).
% 8.05/1.39 cnf(c3, plain,
% 8.05/1.39 $false,
% 8.05/1.39 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 8.05/1.39 cnf(c4, plain,
% 8.05/1.39 $false,
% 8.05/1.39 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 8.05/1.39 cnf(c5, plain,
% 8.05/1.39 X2 != addition(X0,X1) | strong_iteration(multiplication(sK0,zero)) != X2,
% 8.05/1.39 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 8.05/1.39
% 8.05/1.39 cnf(c6, axiom,
% 8.05/1.39 strong_iteration(X3) = addition(multiplication(X3,strong_iteration(X3)),one)).
% 8.05/1.39 cnf(a1, assumption,
% 8.05/1.39 addition(X4,X5) = addition(X0,X1)).
% 8.05/1.39 cnf(c7, plain,
% 8.05/1.39 strong_iteration(multiplication(sK0,zero)) != X2,
% 8.05/1.39 inference(lazy_function_extension, [assumptions([a1])], [c5, c6])).
% 8.05/1.39 cnf(c8, plain,
% 8.05/1.39 $false,
% 8.05/1.39 inference(lazy_function_extension, [assumptions([a1])], [c5, c6])).
% 8.05/1.39 cnf(c9, plain,
% 8.05/1.39 X4 != multiplication(X3,strong_iteration(X3)) | X5 != one | X6 != strong_iteration(X3) | X2 != X6,
% 8.05/1.39 inference(lazy_function_extension, [assumptions([a1])], [c5, c6])).
% 8.05/1.39
% 8.05/1.39 cnf(c10, axiom,
% 8.05/1.39 multiplication(X7,multiplication(X8,X9)) = multiplication(multiplication(X7,X8),X9)).
% 8.05/1.39 cnf(a2, assumption,
% 8.05/1.39 multiplication(X3,strong_iteration(X3)) = multiplication(multiplication(X7,X8),X9)).
% 8.05/1.39 cnf(c11, plain,
% 8.05/1.39 X5 != one | X6 != strong_iteration(X3) | X2 != X6,
% 8.05/1.39 inference(strict_function_extension, [assumptions([a2])], [c9, c10])).
% 8.05/1.39 cnf(c12, plain,
% 8.05/1.39 $false,
% 8.05/1.39 inference(strict_function_extension, [assumptions([a2])], [c9, c10])).
% 8.05/1.39 cnf(c13, plain,
% 8.05/1.39 X10 != multiplication(X7,multiplication(X8,X9)) | X4 != X10,
% 8.05/1.39 inference(strict_function_extension, [assumptions([a2])], [c9, c10])).
% 8.05/1.39
% 8.05/1.39 cnf(c14, axiom,
% 8.05/1.39 zero = multiplication(zero,X11)).
% 8.05/1.39 cnf(a3, assumption,
% 8.05/1.39 multiplication(X8,X9) = multiplication(zero,X11)).
% 8.05/1.39 cnf(c15, plain,
% 8.05/1.39 X4 != X10,
% 8.05/1.39 inference(strict_function_extension, [assumptions([a3])], [c13, c14])).
% 8.05/1.39 cnf(c16, plain,
% 8.05/1.39 $false,
% 8.05/1.39 inference(strict_function_extension, [assumptions([a3])], [c13, c14])).
% 8.05/1.39 cnf(c17, plain,
% 8.05/1.39 X12 != zero | X10 != multiplication(X7,X12),
% 8.05/1.39 inference(strict_function_extension, [assumptions([a3])], [c13, c14])).
% 8.05/1.39
% 8.05/1.39 cnf(a4, assumption,
% 8.05/1.39 X12 = zero).
% 8.05/1.39 cnf(c18, plain,
% 8.05/1.39 X10 != multiplication(X7,X12),
% 8.05/1.39 inference(reflexivity, [assumptions([a4])], [c17])).
% 8.05/1.39
% 8.05/1.39 cnf(a5, assumption,
% 8.05/1.39 X10 = multiplication(X7,X12)).
% 8.05/1.39 cnf(c19, plain,
% 8.05/1.39 $false,
% 8.05/1.39 inference(reflexivity, [assumptions([a5])], [c18])).
% 8.05/1.39
% 8.05/1.39 cnf(a6, assumption,
% 8.05/1.39 X4 = X10).
% 8.05/1.39 cnf(c20, plain,
% 8.05/1.39 $false,
% 8.05/1.39 inference(reflexivity, [assumptions([a6])], [c15])).
% 8.05/1.39
% 8.05/1.39 cnf(a7, assumption,
% 8.05/1.39 X5 = one).
% 8.05/1.39 cnf(c21, plain,
% 8.05/1.39 X6 != strong_iteration(X3) | X2 != X6,
% 8.05/1.39 inference(reflexivity, [assumptions([a7])], [c11])).
% 8.05/1.39
% 8.05/1.39 cnf(a8, assumption,
% 8.05/1.39 X6 = strong_iteration(X3)).
% 8.05/1.39 cnf(c22, plain,
% 8.05/1.39 X2 != X6,
% 8.05/1.39 inference(reflexivity, [assumptions([a8])], [c21])).
% 8.05/1.39
% 8.05/1.39 cnf(a9, assumption,
% 8.05/1.39 X2 = X6).
% 8.05/1.39 cnf(c23, plain,
% 8.05/1.39 $false,
% 8.05/1.39 inference(reflexivity, [assumptions([a9])], [c22])).
% 8.05/1.39
% 8.05/1.39 cnf(a10, assumption,
% 8.05/1.39 strong_iteration(multiplication(sK0,zero)) = X2).
% 8.05/1.39 cnf(c24, plain,
% 8.05/1.39 $false,
% 8.05/1.39 inference(reflexivity, [assumptions([a10])], [c7])).
% 8.05/1.39
% 8.05/1.39 cnf(c25, plain,
% 8.05/1.39 $false,
% 8.05/1.39 inference(constraint_solving, [
% 8.05/1.39 bind(X0, multiplication(sK0,zero)),
% 8.05/1.39 bind(X1, one),
% 8.05/1.39 bind(X2, strong_iteration(X3)),
% 8.05/1.39 bind(X3, multiplication(X7,X8)),
% 8.05/1.39 bind(X6, strong_iteration(X3)),
% 8.05/1.39 bind(X4, multiplication(sK0,zero)),
% 8.05/1.39 bind(X5, one),
% 8.05/1.39 bind(X7, sK0),
% 8.05/1.39 bind(X8, zero),
% 8.05/1.39 bind(X9, strong_iteration(X3)),
% 8.05/1.39 bind(X10, multiplication(X7,X12)),
% 8.05/1.39 bind(X11, strong_iteration(X3)),
% 8.05/1.39 bind(X12, zero)
% 8.05/1.39 ],
% 8.05/1.39 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])).
% 8.05/1.39
% 8.05/1.39 % SZS output end IncompleteProof
%------------------------------------------------------------------------------