TSTP Solution File: KLE150+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : KLE150+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n007.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.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 18 unt; 0 def)
% Number of atoms : 18 ( 17 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 21 (; 20 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A,B] : addition(A,B) = addition(B,A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [A,B,C] : multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [A] : multiplication(zero,A) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f15,axiom,
! [A] : strong_iteration(A) = addition(multiplication(A,strong_iteration(A)),one),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f19,conjecture,
! [X0] : strong_iteration(multiplication(X0,zero)) = addition(one,multiplication(X0,zero)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f20,negated_conjecture,
~ ! [X0] : strong_iteration(multiplication(X0,zero)) = addition(one,multiplication(X0,zero)),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f21,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f25,plain,
! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[status(esa)],[f5]) ).
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] : strong_iteration(multiplication(X0,zero)) != addition(one,multiplication(X0,zero)),
inference(pre_NNF_transformation,[status(esa)],[f20]) ).
fof(f46,plain,
strong_iteration(multiplication(sk0_0,zero)) != addition(one,multiplication(sk0_0,zero)),
inference(skolemization,[status(esa)],[f45]) ).
fof(f47,plain,
strong_iteration(multiplication(sk0_0,zero)) != addition(one,multiplication(sk0_0,zero)),
inference(cnf_transformation,[status(esa)],[f46]) ).
fof(f48,plain,
! [X0] : strong_iteration(X0) = addition(one,multiplication(X0,strong_iteration(X0))),
inference(forward_demodulation,[status(thm)],[f21,f37]) ).
fof(f104,plain,
! [X0,X1] : strong_iteration(multiplication(X0,X1)) = addition(one,multiplication(X0,multiplication(X1,strong_iteration(multiplication(X0,X1))))),
inference(paramodulation,[status(thm)],[f25,f48]) ).
fof(f2821,plain,
! [X0] : strong_iteration(multiplication(X0,zero)) = addition(one,multiplication(X0,zero)),
inference(paramodulation,[status(thm)],[f30,f104]) ).
fof(f2886,plain,
strong_iteration(multiplication(sk0_0,zero)) != strong_iteration(multiplication(sk0_0,zero)),
inference(backward_demodulation,[status(thm)],[f2821,f47]) ).
fof(f2887,plain,
$false,
inference(trivial_equality_resolution,[status(esa)],[f2886]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : KLE150+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31 % Computer : n007.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Tue May 30 11:33:47 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.10/0.32 % Drodi V3.5.1
% 0.16/0.44 % Refutation found
% 0.16/0.44 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.16/0.44 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.16/0.46 % Elapsed time: 0.140098 seconds
% 0.16/0.46 % CPU time: 0.534926 seconds
% 0.16/0.46 % Memory used: 42.913 MB
%------------------------------------------------------------------------------