TSTP Solution File: KLE142+1 by Drodi---3.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : KLE142+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n017.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 0.12s 0.36s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   47 (  28 unt;   0 def)
%            Number of atoms       :   70 (  32 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   50 (  27   ~;  19   |;   2   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    4 (   1 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   :   65 (;  64   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [A,B] : addition(A,B) = addition(B,A),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f2,axiom,
    ! [C,B,A] : addition(A,addition(B,C)) = addition(addition(A,B),C),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f4,axiom,
    ! [A] : addition(A,A) = A,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f6,axiom,
    ! [A] : multiplication(A,one) = A,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f7,axiom,
    ! [A] : multiplication(one,A) = A,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f16,axiom,
    ! [A,B,C] :
      ( leq(C,addition(multiplication(A,C),B))
     => leq(C,multiplication(strong_iteration(A),B)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f18,axiom,
    ! [A,B] :
      ( leq(A,B)
    <=> addition(A,B) = B ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f19,conjecture,
    ! [X0] : strong_iteration(strong_iteration(X0)) = strong_iteration(one),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f20,negated_conjecture,
    ~ ! [X0] : strong_iteration(strong_iteration(X0)) = strong_iteration(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(f24,plain,
    ! [X0] : addition(X0,X0) = X0,
    inference(cnf_transformation,[status(esa)],[f4]) ).

fof(f26,plain,
    ! [X0] : multiplication(X0,one) = X0,
    inference(cnf_transformation,[status(esa)],[f6]) ).

fof(f27,plain,
    ! [X0] : multiplication(one,X0) = X0,
    inference(cnf_transformation,[status(esa)],[f7]) ).

fof(f38,plain,
    ! [A,B,C] :
      ( ~ leq(C,addition(multiplication(A,C),B))
      | leq(C,multiplication(strong_iteration(A),B)) ),
    inference(pre_NNF_transformation,[status(esa)],[f16]) ).

fof(f39,plain,
    ! [X0,X1,X2] :
      ( ~ leq(X0,addition(multiplication(X1,X0),X2))
      | leq(X0,multiplication(strong_iteration(X1),X2)) ),
    inference(cnf_transformation,[status(esa)],[f38]) ).

fof(f41,plain,
    ! [A,B] :
      ( ( ~ leq(A,B)
        | addition(A,B) = B )
      & ( leq(A,B)
        | addition(A,B) != B ) ),
    inference(NNF_transformation,[status(esa)],[f18]) ).

fof(f42,plain,
    ( ! [A,B] :
        ( ~ leq(A,B)
        | addition(A,B) = B )
    & ! [A,B] :
        ( leq(A,B)
        | addition(A,B) != B ) ),
    inference(miniscoping,[status(esa)],[f41]) ).

fof(f43,plain,
    ! [X0,X1] :
      ( ~ leq(X0,X1)
      | addition(X0,X1) = X1 ),
    inference(cnf_transformation,[status(esa)],[f42]) ).

fof(f44,plain,
    ! [X0,X1] :
      ( leq(X0,X1)
      | addition(X0,X1) != X1 ),
    inference(cnf_transformation,[status(esa)],[f42]) ).

fof(f45,plain,
    ? [X0] : strong_iteration(strong_iteration(X0)) != strong_iteration(one),
    inference(pre_NNF_transformation,[status(esa)],[f20]) ).

fof(f46,plain,
    strong_iteration(strong_iteration(sk0_0)) != strong_iteration(one),
    inference(skolemization,[status(esa)],[f45]) ).

fof(f47,plain,
    strong_iteration(strong_iteration(sk0_0)) != strong_iteration(one),
    inference(cnf_transformation,[status(esa)],[f46]) ).

fof(f52,plain,
    ! [X0,X1] :
      ( ~ leq(X0,addition(X0,X1))
      | leq(X0,multiplication(strong_iteration(one),X1)) ),
    inference(paramodulation,[status(thm)],[f27,f39]) ).

fof(f54,plain,
    ! [X0,X1] :
      ( ~ leq(X0,addition(multiplication(X1,X0),one))
      | leq(X0,strong_iteration(X1)) ),
    inference(paramodulation,[status(thm)],[f26,f39]) ).

fof(f55,plain,
    ! [X0,X1] :
      ( ~ leq(X0,addition(one,multiplication(X1,X0)))
      | leq(X0,strong_iteration(X1)) ),
    inference(forward_demodulation,[status(thm)],[f21,f54]) ).

fof(f75,plain,
    ! [X0] :
      ( ~ leq(X0,addition(X0,one))
      | leq(X0,strong_iteration(one)) ),
    inference(paramodulation,[status(thm)],[f26,f52]) ).

fof(f79,plain,
    ! [X0] :
      ( ~ leq(one,addition(one,X0))
      | leq(one,strong_iteration(X0)) ),
    inference(paramodulation,[status(thm)],[f26,f55]) ).

fof(f284,plain,
    ! [X0] :
      ( addition(one,addition(one,X0)) != addition(one,X0)
      | leq(one,strong_iteration(X0)) ),
    inference(resolution,[status(thm)],[f44,f79]) ).

fof(f294,plain,
    ! [X0] :
      ( addition(X0,addition(X0,one)) != addition(X0,one)
      | leq(X0,strong_iteration(one)) ),
    inference(resolution,[status(thm)],[f44,f75]) ).

fof(f371,plain,
    ! [X0,X1] : addition(X0,addition(X0,X1)) = addition(X0,X1),
    inference(paramodulation,[status(thm)],[f24,f22]) ).

fof(f381,plain,
    ! [X0] :
      ( addition(one,X0) != addition(one,X0)
      | leq(one,strong_iteration(X0)) ),
    inference(backward_demodulation,[status(thm)],[f371,f284]) ).

fof(f382,plain,
    ! [X0] : leq(one,strong_iteration(X0)),
    inference(trivial_equality_resolution,[status(esa)],[f381]) ).

fof(f383,plain,
    ! [X0] :
      ( addition(X0,one) != addition(X0,one)
      | leq(X0,strong_iteration(one)) ),
    inference(backward_demodulation,[status(thm)],[f371,f294]) ).

fof(f384,plain,
    ! [X0] : leq(X0,strong_iteration(one)),
    inference(trivial_equality_resolution,[status(esa)],[f383]) ).

fof(f437,plain,
    ! [X0] : addition(one,strong_iteration(X0)) = strong_iteration(X0),
    inference(resolution,[status(thm)],[f382,f43]) ).

fof(f439,plain,
    ! [X0] : addition(X0,strong_iteration(one)) = strong_iteration(one),
    inference(resolution,[status(thm)],[f384,f43]) ).

fof(f502,plain,
    ! [X0] : addition(strong_iteration(one),X0) = strong_iteration(one),
    inference(paramodulation,[status(thm)],[f21,f439]) ).

fof(f506,plain,
    ! [X0,X1] :
      ( ~ leq(X0,strong_iteration(one))
      | leq(X0,multiplication(strong_iteration(X1),strong_iteration(one))) ),
    inference(paramodulation,[status(thm)],[f439,f39]) ).

fof(f507,plain,
    ! [X0,X1] : leq(X0,multiplication(strong_iteration(X1),strong_iteration(one))),
    inference(forward_subsumption_resolution,[status(thm)],[f506,f384]) ).

fof(f535,plain,
    ! [X0] :
      ( ~ leq(strong_iteration(one),X0)
      | strong_iteration(one) = X0 ),
    inference(paramodulation,[status(thm)],[f502,f43]) ).

fof(f1057,plain,
    ! [X0] : strong_iteration(one) = multiplication(strong_iteration(X0),strong_iteration(one)),
    inference(resolution,[status(thm)],[f535,f507]) ).

fof(f1063,plain,
    ~ leq(strong_iteration(one),strong_iteration(strong_iteration(sk0_0))),
    inference(resolution,[status(thm)],[f535,f47]) ).

fof(f1106,plain,
    ~ leq(strong_iteration(one),addition(one,multiplication(strong_iteration(sk0_0),strong_iteration(one)))),
    inference(resolution,[status(thm)],[f1063,f55]) ).

fof(f1107,plain,
    ~ leq(strong_iteration(one),addition(one,strong_iteration(one))),
    inference(forward_demodulation,[status(thm)],[f1057,f1106]) ).

fof(f1108,plain,
    ~ leq(strong_iteration(one),strong_iteration(one)),
    inference(forward_demodulation,[status(thm)],[f437,f1107]) ).

fof(f1109,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f1108,f384]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : KLE142+1 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.12  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.33  % Computer : n017.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Tue May 30 11:14:10 EDT 2023
% 0.12/0.33  % CPUTime  : 
% 0.12/0.34  % Drodi V3.5.1
% 0.12/0.36  % Refutation found
% 0.12/0.36  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.36  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.37  % Elapsed time: 0.037287 seconds
% 0.12/0.37  % CPU time: 0.129839 seconds
% 0.12/0.37  % Memory used: 10.993 MB
%------------------------------------------------------------------------------