TSTP Solution File: KLE119+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : KLE119+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n003.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:49 EDT 2023
% Result : Theorem 0.14s 0.36s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 44 ( 38 unt; 0 def)
% Number of atoms : 54 ( 42 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 24 ( 14 ~; 7 |; 2 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 46 (; 44 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A,B] : addition(A,B) = addition(B,A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [A] : addition(A,zero) = A,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [A] : multiplication(one,A) = A,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [A] : multiplication(A,zero) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f12,axiom,
! [A,B] :
( leq(A,B)
<=> addition(A,B) = B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,axiom,
! [X0] : multiplication(X0,coantidomain(X0)) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f19,axiom,
! [X0] : addition(coantidomain(coantidomain(X0)),coantidomain(X0)) = one,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f20,axiom,
! [X0] : codomain(X0) = coantidomain(coantidomain(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f24,axiom,
! [X0,X1] : backward_diamond(X0,X1) = codomain(multiplication(codomain(X1),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f27,conjecture,
! [X0,X1] : addition(backward_diamond(zero,domain(X0)),domain(X1)) = domain(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f28,negated_conjecture,
~ ! [X0,X1] : addition(backward_diamond(zero,domain(X0)),domain(X1)) = domain(X1),
inference(negated_conjecture,[status(cth)],[f27]) ).
fof(f29,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f31,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f35,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f38,plain,
! [X0] : multiplication(X0,zero) = zero,
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f40,plain,
! [A,B] :
( ( ~ leq(A,B)
| addition(A,B) = B )
& ( leq(A,B)
| addition(A,B) != B ) ),
inference(NNF_transformation,[status(esa)],[f12]) ).
fof(f41,plain,
( ! [A,B] :
( ~ leq(A,B)
| addition(A,B) = B )
& ! [A,B] :
( leq(A,B)
| addition(A,B) != B ) ),
inference(miniscoping,[status(esa)],[f40]) ).
fof(f42,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(cnf_transformation,[status(esa)],[f41]) ).
fof(f43,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(cnf_transformation,[status(esa)],[f41]) ).
fof(f48,plain,
! [X0] : multiplication(X0,coantidomain(X0)) = zero,
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f50,plain,
! [X0] : addition(coantidomain(coantidomain(X0)),coantidomain(X0)) = one,
inference(cnf_transformation,[status(esa)],[f19]) ).
fof(f51,plain,
! [X0] : codomain(X0) = coantidomain(coantidomain(X0)),
inference(cnf_transformation,[status(esa)],[f20]) ).
fof(f55,plain,
! [X0,X1] : backward_diamond(X0,X1) = codomain(multiplication(codomain(X1),X0)),
inference(cnf_transformation,[status(esa)],[f24]) ).
fof(f58,plain,
? [X0,X1] : addition(backward_diamond(zero,domain(X0)),domain(X1)) != domain(X1),
inference(pre_NNF_transformation,[status(esa)],[f28]) ).
fof(f59,plain,
addition(backward_diamond(zero,domain(sk0_0)),domain(sk0_1)) != domain(sk0_1),
inference(skolemization,[status(esa)],[f58]) ).
fof(f60,plain,
addition(backward_diamond(zero,domain(sk0_0)),domain(sk0_1)) != domain(sk0_1),
inference(cnf_transformation,[status(esa)],[f59]) ).
fof(f62,plain,
! [X0] : addition(coantidomain(X0),coantidomain(coantidomain(X0))) = one,
inference(forward_demodulation,[status(thm)],[f29,f50]) ).
fof(f63,plain,
addition(domain(sk0_1),backward_diamond(zero,domain(sk0_0))) != domain(sk0_1),
inference(forward_demodulation,[status(thm)],[f29,f60]) ).
fof(f67,plain,
! [X0] : addition(coantidomain(X0),codomain(X0)) = one,
inference(backward_demodulation,[status(thm)],[f51,f62]) ).
fof(f70,plain,
! [X0] : X0 = addition(zero,X0),
inference(paramodulation,[status(thm)],[f31,f29]) ).
fof(f150,plain,
zero = coantidomain(one),
inference(paramodulation,[status(thm)],[f48,f35]) ).
fof(f165,plain,
addition(zero,codomain(one)) = one,
inference(paramodulation,[status(thm)],[f150,f67]) ).
fof(f166,plain,
codomain(one) = one,
inference(forward_demodulation,[status(thm)],[f70,f165]) ).
fof(f197,plain,
codomain(one) = coantidomain(zero),
inference(paramodulation,[status(thm)],[f150,f51]) ).
fof(f198,plain,
one = coantidomain(zero),
inference(forward_demodulation,[status(thm)],[f166,f197]) ).
fof(f202,plain,
codomain(zero) = coantidomain(one),
inference(paramodulation,[status(thm)],[f198,f51]) ).
fof(f203,plain,
codomain(zero) = zero,
inference(forward_demodulation,[status(thm)],[f150,f202]) ).
fof(f233,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| addition(X1,X0) = X1 ),
inference(paramodulation,[status(thm)],[f29,f42]) ).
fof(f310,plain,
! [X0] : leq(zero,X0),
inference(resolution,[status(thm)],[f43,f70]) ).
fof(f332,plain,
~ leq(backward_diamond(zero,domain(sk0_0)),domain(sk0_1)),
inference(resolution,[status(thm)],[f233,f63]) ).
fof(f347,plain,
! [X0] : backward_diamond(zero,X0) = codomain(zero),
inference(paramodulation,[status(thm)],[f38,f55]) ).
fof(f348,plain,
! [X0] : backward_diamond(zero,X0) = zero,
inference(forward_demodulation,[status(thm)],[f203,f347]) ).
fof(f357,plain,
~ leq(zero,domain(sk0_1)),
inference(backward_demodulation,[status(thm)],[f348,f332]) ).
fof(f358,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f357,f310]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KLE119+1 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.34 % Computer : n003.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 11:49:53 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.14/0.35 % Drodi V3.5.1
% 0.14/0.36 % Refutation found
% 0.14/0.36 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.20/0.58 % Elapsed time: 0.017249 seconds
% 0.20/0.58 % CPU time: 0.063195 seconds
% 0.20/0.58 % Memory used: 9.932 MB
%------------------------------------------------------------------------------