TSTP Solution File: KLE139+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : KLE139+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n010.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:52 EDT 2023
% Result : Theorem 23.22s 3.40s
% Output : CNFRefutation 23.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 28 unt; 0 def)
% Number of atoms : 28 ( 27 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 39 (; 38 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A,B] : addition(A,B) = addition(B,A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [C,B,A] : addition(A,addition(B,C)) = addition(addition(A,B),C),
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(f9,axiom,
! [A,B,C] : multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [A] : multiplication(zero,A) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f12,axiom,
! [A] : addition(one,multiplication(star(A),A)) = star(A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,axiom,
! [A] : strong_iteration(A) = addition(star(A),multiplication(strong_iteration(A),zero)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f19,conjecture,
! [X0] : strong_iteration(X0) = addition(multiplication(strong_iteration(X0),X0),one),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f20,negated_conjecture,
~ ! [X0] : strong_iteration(X0) = addition(multiplication(strong_iteration(X0),X0),one),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f21,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f22,plain,
! [X0,X1,X2] : addition(X0,addition(X1,X2)) = addition(addition(X0,X1),X2),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f25,plain,
! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f29,plain,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f30,plain,
! [X0] : multiplication(zero,X0) = zero,
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f32,plain,
! [X0] : addition(one,multiplication(star(X0),X0)) = star(X0),
inference(cnf_transformation,[status(esa)],[f12]) ).
fof(f40,plain,
! [X0] : strong_iteration(X0) = addition(star(X0),multiplication(strong_iteration(X0),zero)),
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f45,plain,
? [X0] : strong_iteration(X0) != addition(multiplication(strong_iteration(X0),X0),one),
inference(pre_NNF_transformation,[status(esa)],[f20]) ).
fof(f46,plain,
strong_iteration(sk0_0) != addition(multiplication(strong_iteration(sk0_0),sk0_0),one),
inference(skolemization,[status(esa)],[f45]) ).
fof(f47,plain,
strong_iteration(sk0_0) != addition(multiplication(strong_iteration(sk0_0),sk0_0),one),
inference(cnf_transformation,[status(esa)],[f46]) ).
fof(f48,plain,
strong_iteration(sk0_0) != addition(one,multiplication(strong_iteration(sk0_0),sk0_0)),
inference(paramodulation,[status(thm)],[f21,f47]) ).
fof(f62,plain,
! [X0,X1] : addition(one,addition(multiplication(star(X0),X0),X1)) = addition(star(X0),X1),
inference(paramodulation,[status(thm)],[f32,f22]) ).
fof(f673,plain,
! [X0,X1] : addition(one,multiplication(addition(star(X0),X1),X0)) = addition(star(X0),multiplication(X1,X0)),
inference(paramodulation,[status(thm)],[f29,f62]) ).
fof(f30570,plain,
! [X0] : addition(one,multiplication(strong_iteration(X0),X0)) = addition(star(X0),multiplication(multiplication(strong_iteration(X0),zero),X0)),
inference(paramodulation,[status(thm)],[f40,f673]) ).
fof(f30571,plain,
! [X0] : addition(one,multiplication(strong_iteration(X0),X0)) = addition(star(X0),multiplication(strong_iteration(X0),multiplication(zero,X0))),
inference(forward_demodulation,[status(thm)],[f25,f30570]) ).
fof(f30572,plain,
! [X0] : addition(one,multiplication(strong_iteration(X0),X0)) = addition(star(X0),multiplication(strong_iteration(X0),zero)),
inference(forward_demodulation,[status(thm)],[f30,f30571]) ).
fof(f30573,plain,
! [X0] : addition(one,multiplication(strong_iteration(X0),X0)) = strong_iteration(X0),
inference(forward_demodulation,[status(thm)],[f40,f30572]) ).
fof(f31756,plain,
strong_iteration(sk0_0) != strong_iteration(sk0_0),
inference(backward_demodulation,[status(thm)],[f30573,f48]) ).
fof(f31757,plain,
$false,
inference(trivial_equality_resolution,[status(esa)],[f31756]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : KLE139+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.30 % Computer : n010.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue May 30 11:36:22 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.10/0.31 % Drodi V3.5.1
% 23.22/3.40 % Refutation found
% 23.22/3.40 % SZS status Theorem for theBenchmark: Theorem is valid
% 23.22/3.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 23.96/3.47 % Elapsed time: 3.151889 seconds
% 23.96/3.47 % CPU time: 24.191416 seconds
% 23.96/3.47 % Memory used: 249.363 MB
%------------------------------------------------------------------------------