TSTP Solution File: KLE070+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : KLE070+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n011.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:43 EDT 2023
% Result : Theorem 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 22 unt; 0 def)
% Number of atoms : 38 ( 28 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 27 ( 17 ~; 7 |; 2 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 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(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(f12,axiom,
! [A,B] :
( leq(A,B)
<=> addition(A,B) = B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f15,axiom,
! [X0] : addition(domain(X0),one) = one,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f18,conjecture,
! [X0,X1] : addition(domain(X0),multiplication(domain(X0),domain(X1))) = domain(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f19,negated_conjecture,
~ ! [X0,X1] : addition(domain(X0),multiplication(domain(X0),domain(X1))) = domain(X0),
inference(negated_conjecture,[status(cth)],[f18]) ).
fof(f20,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f25,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f27,plain,
! [X0,X1,X2] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f31,plain,
! [A,B] :
( ( ~ leq(A,B)
| addition(A,B) = B )
& ( leq(A,B)
| addition(A,B) != B ) ),
inference(NNF_transformation,[status(esa)],[f12]) ).
fof(f32,plain,
( ! [A,B] :
( ~ leq(A,B)
| addition(A,B) = B )
& ! [A,B] :
( leq(A,B)
| addition(A,B) != B ) ),
inference(miniscoping,[status(esa)],[f31]) ).
fof(f33,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(cnf_transformation,[status(esa)],[f32]) ).
fof(f34,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(cnf_transformation,[status(esa)],[f32]) ).
fof(f37,plain,
! [X0] : addition(domain(X0),one) = one,
inference(cnf_transformation,[status(esa)],[f15]) ).
fof(f40,plain,
? [X0,X1] : addition(domain(X0),multiplication(domain(X0),domain(X1))) != domain(X0),
inference(pre_NNF_transformation,[status(esa)],[f19]) ).
fof(f41,plain,
addition(domain(sk0_0),multiplication(domain(sk0_0),domain(sk0_1))) != domain(sk0_0),
inference(skolemization,[status(esa)],[f40]) ).
fof(f42,plain,
addition(domain(sk0_0),multiplication(domain(sk0_0),domain(sk0_1))) != domain(sk0_0),
inference(cnf_transformation,[status(esa)],[f41]) ).
fof(f43,plain,
! [X0] : addition(one,domain(X0)) = one,
inference(forward_demodulation,[status(thm)],[f20,f37]) ).
fof(f827,plain,
! [X0,X1] : multiplication(X0,addition(one,X1)) = addition(X0,multiplication(X0,X1)),
inference(paramodulation,[status(thm)],[f25,f27]) ).
fof(f973,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| addition(X1,X0) = X1 ),
inference(paramodulation,[status(thm)],[f20,f33]) ).
fof(f1364,plain,
~ leq(multiplication(domain(sk0_0),domain(sk0_1)),domain(sk0_0)),
inference(resolution,[status(thm)],[f973,f42]) ).
fof(f1394,plain,
addition(multiplication(domain(sk0_0),domain(sk0_1)),domain(sk0_0)) != domain(sk0_0),
inference(resolution,[status(thm)],[f1364,f34]) ).
fof(f1395,plain,
addition(domain(sk0_0),multiplication(domain(sk0_0),domain(sk0_1))) != domain(sk0_0),
inference(forward_demodulation,[status(thm)],[f20,f1394]) ).
fof(f1396,plain,
multiplication(domain(sk0_0),addition(one,domain(sk0_1))) != domain(sk0_0),
inference(forward_demodulation,[status(thm)],[f827,f1395]) ).
fof(f1397,plain,
multiplication(domain(sk0_0),one) != domain(sk0_0),
inference(forward_demodulation,[status(thm)],[f43,f1396]) ).
fof(f1398,plain,
domain(sk0_0) != domain(sk0_0),
inference(forward_demodulation,[status(thm)],[f25,f1397]) ).
fof(f1399,plain,
$false,
inference(trivial_equality_resolution,[status(esa)],[f1398]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE070+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n011.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue May 30 11:47:57 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % Drodi V3.5.1
% 0.20/0.48 % Refutation found
% 0.20/0.48 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.20/0.48 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.20/0.50 % Elapsed time: 0.146220 seconds
% 0.20/0.50 % CPU time: 0.632424 seconds
% 0.20/0.50 % Memory used: 42.215 MB
%------------------------------------------------------------------------------