TSTP Solution File: KLE070+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : KLE070+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:24 EDT 2022
% Result : Theorem 66.37s 9.03s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : KLE070+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.15 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.15/0.37 % Computer : n023.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 600
% 0.15/0.37 % DateTime : Thu Jun 16 12:27:05 EDT 2022
% 0.15/0.37 % CPUTime :
% 66.37/9.03 % SZS status Theorem
% 66.37/9.03 % SZS output begin IncompleteProof
% 66.37/9.03 cnf(c0, axiom,
% 66.37/9.03 domain(sK0) != addition(domain(sK0),multiplication(domain(sK0),domain(sK1)))).
% 66.37/9.03 cnf(c1, plain,
% 66.37/9.03 domain(sK0) != addition(domain(sK0),multiplication(domain(sK0),domain(sK1))),
% 66.37/9.03 inference(start, [], [c0])).
% 66.37/9.03
% 66.37/9.03 cnf(c2, axiom,
% 66.37/9.03 multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2))).
% 66.37/9.03 cnf(a0, assumption,
% 66.37/9.03 addition(X3,X4) = addition(domain(sK0),multiplication(domain(sK0),domain(sK1)))).
% 66.37/9.03 cnf(c3, plain,
% 66.37/9.03 $false,
% 66.37/9.03 inference(lazy_function_extension, [assumptions([a0])], [c1, c2])).
% 66.37/9.03 cnf(c4, plain,
% 66.37/9.03 $false,
% 66.37/9.03 inference(lazy_function_extension, [assumptions([a0])], [c1, c2])).
% 66.37/9.03 cnf(c5, plain,
% 66.37/9.03 X3 != multiplication(X0,X1) | X4 != multiplication(X0,X2) | X5 != multiplication(X0,addition(X1,X2)) | domain(sK0) != X5,
% 66.37/9.03 inference(lazy_function_extension, [assumptions([a0])], [c1, c2])).
% 66.37/9.03
% 66.37/9.03 cnf(c6, axiom,
% 66.37/9.03 multiplication(X6,one) = X6).
% 66.37/9.03 cnf(a1, assumption,
% 66.37/9.03 multiplication(X0,X1) = multiplication(X6,one)).
% 66.37/9.03 cnf(c7, plain,
% 66.37/9.03 X4 != multiplication(X0,X2) | X5 != multiplication(X0,addition(X1,X2)) | domain(sK0) != X5,
% 66.37/9.03 inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 66.37/9.03 cnf(c8, plain,
% 66.37/9.03 $false,
% 66.37/9.03 inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 66.37/9.03 cnf(c9, plain,
% 66.37/9.03 X7 != X6 | X3 != X7,
% 66.37/9.03 inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 66.37/9.03
% 66.37/9.03 cnf(a2, assumption,
% 66.37/9.03 X7 = X6).
% 66.37/9.03 cnf(c10, plain,
% 66.37/9.03 X3 != X7,
% 66.37/9.03 inference(reflexivity, [assumptions([a2])], [c9])).
% 66.37/9.03
% 66.37/9.03 cnf(a3, assumption,
% 66.37/9.03 X3 = X7).
% 66.37/9.03 cnf(c11, plain,
% 66.37/9.03 $false,
% 66.37/9.03 inference(reflexivity, [assumptions([a3])], [c10])).
% 66.37/9.03
% 66.37/9.03 cnf(a4, assumption,
% 66.37/9.03 X4 = multiplication(X0,X2)).
% 66.37/9.03 cnf(c12, plain,
% 66.37/9.03 X5 != multiplication(X0,addition(X1,X2)) | domain(sK0) != X5,
% 66.37/9.03 inference(reflexivity, [assumptions([a4])], [c7])).
% 66.37/9.03
% 66.37/9.03 cnf(c13, axiom,
% 66.37/9.03 addition(X8,X9) = addition(X9,X8)).
% 66.37/9.03 cnf(a5, assumption,
% 66.37/9.03 addition(X1,X2) = addition(X8,X9)).
% 66.37/9.03 cnf(c14, plain,
% 66.37/9.03 domain(sK0) != X5,
% 66.37/9.03 inference(strict_function_extension, [assumptions([a5])], [c12, c13])).
% 66.37/9.03 cnf(c15, plain,
% 66.37/9.03 $false,
% 66.37/9.03 inference(strict_function_extension, [assumptions([a5])], [c12, c13])).
% 66.37/9.03 cnf(c16, plain,
% 66.37/9.03 X10 != addition(X9,X8) | X5 != multiplication(X0,X10),
% 66.37/9.03 inference(strict_function_extension, [assumptions([a5])], [c12, c13])).
% 66.37/9.03
% 66.37/9.03 cnf(c17, axiom,
% 66.37/9.03 one = addition(domain(X11),one)).
% 66.37/9.03 cnf(a6, assumption,
% 66.37/9.03 addition(X9,X8) = addition(domain(X11),one)).
% 66.37/9.03 cnf(c18, plain,
% 66.37/9.03 X5 != multiplication(X0,X10),
% 66.37/9.03 inference(strict_function_extension, [assumptions([a6])], [c16, c17])).
% 66.37/9.03 cnf(c19, plain,
% 66.37/9.03 $false,
% 66.37/9.03 inference(strict_function_extension, [assumptions([a6])], [c16, c17])).
% 66.37/9.03 cnf(c20, plain,
% 66.37/9.03 X12 != one | X10 != X12,
% 66.37/9.03 inference(strict_function_extension, [assumptions([a6])], [c16, c17])).
% 66.37/9.03
% 66.37/9.03 cnf(a7, assumption,
% 66.37/9.03 X12 = one).
% 66.37/9.03 cnf(c21, plain,
% 66.37/9.03 X10 != X12,
% 66.37/9.03 inference(reflexivity, [assumptions([a7])], [c20])).
% 66.37/9.03
% 66.37/9.03 cnf(a8, assumption,
% 66.37/9.03 X10 = X12).
% 66.37/9.03 cnf(c22, plain,
% 66.37/9.03 $false,
% 66.37/9.03 inference(reflexivity, [assumptions([a8])], [c21])).
% 66.37/9.03
% 66.37/9.03 cnf(c23, plain,
% 66.37/9.03 X3 = multiplication(X0,X1)).
% 66.37/9.03 cnf(a9, assumption,
% 66.37/9.03 multiplication(X0,X10) = multiplication(X0,X1)).
% 66.37/9.03 cnf(c24, plain,
% 66.37/9.03 $false,
% 66.37/9.03 inference(equality_reduction, [assumptions([a9])], [c18, c23])).
% 66.37/9.03 cnf(c25, plain,
% 66.37/9.03 X5 != X3,
% 66.37/9.03 inference(equality_reduction, [assumptions([a9])], [c18, c23])).
% 66.37/9.03
% 66.37/9.03 cnf(a10, assumption,
% 66.37/9.03 X5 = X3).
% 66.37/9.03 cnf(c26, plain,
% 66.37/9.03 $false,
% 66.37/9.03 inference(reflexivity, [assumptions([a10])], [c25])).
% 66.37/9.03
% 66.37/9.03 cnf(a11, assumption,
% 66.37/9.03 domain(sK0) = X5).
% 66.37/9.03 cnf(c27, plain,
% 66.37/9.03 $false,
% 66.37/9.03 inference(reflexivity, [assumptions([a11])], [c14])).
% 66.37/9.03
% 66.37/9.03 cnf(c28, plain,
% 66.37/9.03 $false,
% 66.37/9.03 inference(constraint_solving, [
% 66.37/9.03 bind(X0, domain(sK0)),
% 66.37/9.03 bind(X1, one),
% 66.37/9.03 bind(X2, domain(sK1)),
% 66.37/9.03 bind(X5, domain(sK0)),
% 66.37/9.03 bind(X3, domain(sK0)),
% 66.37/9.03 bind(X4, multiplication(domain(sK0),domain(sK1))),
% 66.37/9.03 bind(X6, domain(sK0)),
% 66.37/9.03 bind(X7, domain(sK0)),
% 66.37/9.03 bind(X8, one),
% 66.37/9.03 bind(X9, domain(sK1)),
% 66.37/9.03 bind(X10, one),
% 66.37/9.03 bind(X11, sK1),
% 66.37/9.03 bind(X12, one)
% 66.37/9.03 ],
% 66.37/9.03 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])).
% 66.37/9.03
% 66.37/9.03 % SZS output end IncompleteProof
%------------------------------------------------------------------------------