TSTP Solution File: KLE037+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : KLE037+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:36 EDT 2023
% Result : Theorem 0.21s 0.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 22 unt; 0 def)
% Number of atoms : 36 ( 21 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 21 ( 12 ~; 6 |; 2 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 36 (; 35 !; 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(f4,axiom,
! [A] : addition(A,A) = A,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f12,axiom,
! [A,B] :
( leq(A,B)
<=> addition(A,B) = B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f13,axiom,
! [A] : leq(addition(one,multiplication(A,star(A))),star(A)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,conjecture,
! [X0] : leq(one,star(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f18,negated_conjecture,
~ ! [X0] : leq(one,star(X0)),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f19,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f20,plain,
! [X0,X1,X2] : addition(X0,addition(X1,X2)) = addition(addition(X0,X1),X2),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f22,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f30,plain,
! [A,B] :
( ( ~ leq(A,B)
| addition(A,B) = B )
& ( leq(A,B)
| addition(A,B) != B ) ),
inference(NNF_transformation,[status(esa)],[f12]) ).
fof(f31,plain,
( ! [A,B] :
( ~ leq(A,B)
| addition(A,B) = B )
& ! [A,B] :
( leq(A,B)
| addition(A,B) != B ) ),
inference(miniscoping,[status(esa)],[f30]) ).
fof(f32,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(cnf_transformation,[status(esa)],[f31]) ).
fof(f33,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(cnf_transformation,[status(esa)],[f31]) ).
fof(f34,plain,
! [X0] : leq(addition(one,multiplication(X0,star(X0))),star(X0)),
inference(cnf_transformation,[status(esa)],[f13]) ).
fof(f40,plain,
? [X0] : ~ leq(one,star(X0)),
inference(pre_NNF_transformation,[status(esa)],[f18]) ).
fof(f41,plain,
~ leq(one,star(sk0_0)),
inference(skolemization,[status(esa)],[f40]) ).
fof(f42,plain,
~ leq(one,star(sk0_0)),
inference(cnf_transformation,[status(esa)],[f41]) ).
fof(f43,plain,
addition(one,star(sk0_0)) != star(sk0_0),
inference(resolution,[status(thm)],[f33,f42]) ).
fof(f44,plain,
! [X0] : addition(addition(one,multiplication(X0,star(X0))),star(X0)) = star(X0),
inference(resolution,[status(thm)],[f34,f32]) ).
fof(f45,plain,
! [X0] : addition(one,addition(multiplication(X0,star(X0)),star(X0))) = star(X0),
inference(forward_demodulation,[status(thm)],[f20,f44]) ).
fof(f46,plain,
! [X0] : addition(one,addition(star(X0),multiplication(X0,star(X0)))) = star(X0),
inference(forward_demodulation,[status(thm)],[f19,f45]) ).
fof(f175,plain,
! [X0,X1] : addition(X0,addition(X0,X1)) = addition(X0,X1),
inference(paramodulation,[status(thm)],[f22,f20]) ).
fof(f186,plain,
! [X0] : addition(one,star(X0)) = addition(one,addition(star(X0),multiplication(X0,star(X0)))),
inference(paramodulation,[status(thm)],[f46,f175]) ).
fof(f187,plain,
! [X0] : addition(one,star(X0)) = star(X0),
inference(forward_demodulation,[status(thm)],[f46,f186]) ).
fof(f201,plain,
star(sk0_0) != star(sk0_0),
inference(backward_demodulation,[status(thm)],[f187,f43]) ).
fof(f202,plain,
$false,
inference(trivial_equality_resolution,[status(esa)],[f201]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE037+1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n010.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue May 30 11:36:52 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.5.1
% 0.21/0.40 % Refutation found
% 0.21/0.40 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.21/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.39/0.63 % Elapsed time: 0.074272 seconds
% 0.39/0.63 % CPU time: 0.132407 seconds
% 0.39/0.63 % Memory used: 12.447 MB
%------------------------------------------------------------------------------