TSTP Solution File: KLE148+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : KLE148+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n028.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 : Wed May 31 12:15:55 EDT 2023
% Result : Theorem 0.14s 0.37s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 24 unt; 0 def)
% Number of atoms : 32 ( 31 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 8 ( 4 ~; 0 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 37 (; 35 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A,B] : addition(A,B) = addition(B,A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [A] : addition(A,zero) = A,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [A,B,C] : multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [A] : multiplication(A,one) = A,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [A,B,C] : multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [A] : multiplication(zero,A) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f15,axiom,
! [A] : strong_iteration(A) = addition(multiplication(A,strong_iteration(A)),one),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f19,conjecture,
! [X0,X1] :
( multiplication(X0,X1) = zero
=> multiplication(X0,strong_iteration(X1)) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f20,negated_conjecture,
~ ! [X0,X1] :
( multiplication(X0,X1) = zero
=> multiplication(X0,strong_iteration(X1)) = X0 ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f21,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f23,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f25,plain,
! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f26,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f28,plain,
! [X0,X1,X2] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f30,plain,
! [X0] : multiplication(zero,X0) = zero,
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f37,plain,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
inference(cnf_transformation,[status(esa)],[f15]) ).
fof(f45,plain,
? [X0,X1] :
( multiplication(X0,X1) = zero
& multiplication(X0,strong_iteration(X1)) != X0 ),
inference(pre_NNF_transformation,[status(esa)],[f20]) ).
fof(f46,plain,
( multiplication(sk0_0,sk0_1) = zero
& multiplication(sk0_0,strong_iteration(sk0_1)) != sk0_0 ),
inference(skolemization,[status(esa)],[f45]) ).
fof(f47,plain,
multiplication(sk0_0,sk0_1) = zero,
inference(cnf_transformation,[status(esa)],[f46]) ).
fof(f48,plain,
multiplication(sk0_0,strong_iteration(sk0_1)) != sk0_0,
inference(cnf_transformation,[status(esa)],[f46]) ).
fof(f54,plain,
! [X0] : multiplication(sk0_0,multiplication(sk0_1,X0)) = multiplication(zero,X0),
inference(paramodulation,[status(thm)],[f47,f25]) ).
fof(f55,plain,
! [X0] : multiplication(sk0_0,multiplication(sk0_1,X0)) = zero,
inference(forward_demodulation,[status(thm)],[f30,f54]) ).
fof(f104,plain,
! [X0] : strong_iteration(X0) = addition(one,multiplication(X0,strong_iteration(X0))),
inference(forward_demodulation,[status(thm)],[f21,f37]) ).
fof(f204,plain,
! [X0,X1] : multiplication(sk0_0,addition(X0,multiplication(sk0_1,X1))) = addition(multiplication(sk0_0,X0),zero),
inference(paramodulation,[status(thm)],[f55,f28]) ).
fof(f205,plain,
! [X0,X1] : multiplication(sk0_0,addition(X0,multiplication(sk0_1,X1))) = multiplication(sk0_0,X0),
inference(forward_demodulation,[status(thm)],[f23,f204]) ).
fof(f400,plain,
multiplication(sk0_0,strong_iteration(sk0_1)) = multiplication(sk0_0,one),
inference(paramodulation,[status(thm)],[f104,f205]) ).
fof(f401,plain,
multiplication(sk0_0,strong_iteration(sk0_1)) = sk0_0,
inference(forward_demodulation,[status(thm)],[f26,f400]) ).
fof(f402,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f401,f48]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : KLE148+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue May 30 12:00:47 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % Drodi V3.5.1
% 0.14/0.37 % Refutation found
% 0.14/0.37 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.38 % Elapsed time: 0.030380 seconds
% 0.14/0.38 % CPU time: 0.061946 seconds
% 0.14/0.38 % Memory used: 9.694 MB
%------------------------------------------------------------------------------