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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : GRP702+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:12:34 EDT 2023

% Result   : Theorem 0.15s 0.50s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   47 (  22 unt;   0 def)
%            Number of atoms       :   79 (  51 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   60 (  28   ~;  25   |;   4   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   4 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   9 con; 0-2 aty)
%            Number of variables   :   44 (;  36   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [B,A] : ld(A,mult(A,B)) = B,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f5,axiom,
    ! [A] : mult(A,unit) = A,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f7,axiom,
    ! [C,B,A] : mult(A,mult(B,mult(B,C))) = mult(mult(mult(A,B),B),C),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f8,axiom,
    ! [B,A] : mult(op_c,mult(A,B)) = mult(mult(op_c,A),B),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f9,axiom,
    ! [B,A] : mult(A,mult(B,op_c)) = mult(mult(A,B),op_c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f10,axiom,
    ! [B,A] : mult(A,mult(op_c,B)) = mult(mult(A,op_c),B),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f11,axiom,
    ! [A] : op_d = ld(A,mult(op_c,A)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f14,conjecture,
    ! [X0,X1] :
      ( mult(op_d,mult(X0,X1)) = mult(mult(op_d,X0),X1)
      & mult(X0,mult(X1,op_d)) = mult(mult(X0,X1),op_d)
      & mult(X0,mult(op_d,X1)) = mult(mult(X0,op_d),X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f15,negated_conjecture,
    ~ ! [X0,X1] :
        ( mult(op_d,mult(X0,X1)) = mult(mult(op_d,X0),X1)
        & mult(X0,mult(X1,op_d)) = mult(mult(X0,X1),op_d)
        & mult(X0,mult(op_d,X1)) = mult(mult(X0,op_d),X1) ),
    inference(negated_conjecture,[status(cth)],[f14]) ).

fof(f17,plain,
    ! [X0,X1] : ld(X0,mult(X0,X1)) = X1,
    inference(cnf_transformation,[status(esa)],[f2]) ).

fof(f20,plain,
    ! [X0] : mult(X0,unit) = X0,
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f22,plain,
    ! [X0,X1,X2] : mult(X0,mult(X1,mult(X1,X2))) = mult(mult(mult(X0,X1),X1),X2),
    inference(cnf_transformation,[status(esa)],[f7]) ).

fof(f23,plain,
    ! [X0,X1] : mult(op_c,mult(X0,X1)) = mult(mult(op_c,X0),X1),
    inference(cnf_transformation,[status(esa)],[f8]) ).

fof(f24,plain,
    ! [X0,X1] : mult(X0,mult(X1,op_c)) = mult(mult(X0,X1),op_c),
    inference(cnf_transformation,[status(esa)],[f9]) ).

fof(f25,plain,
    ! [X0,X1] : mult(X0,mult(op_c,X1)) = mult(mult(X0,op_c),X1),
    inference(cnf_transformation,[status(esa)],[f10]) ).

fof(f26,plain,
    ! [X0] : op_d = ld(X0,mult(op_c,X0)),
    inference(cnf_transformation,[status(esa)],[f11]) ).

fof(f29,plain,
    ? [X0,X1] :
      ( mult(op_d,mult(X0,X1)) != mult(mult(op_d,X0),X1)
      | mult(X0,mult(X1,op_d)) != mult(mult(X0,X1),op_d)
      | mult(X0,mult(op_d,X1)) != mult(mult(X0,op_d),X1) ),
    inference(pre_NNF_transformation,[status(esa)],[f15]) ).

fof(f30,plain,
    ( ? [X0,X1] : mult(op_d,mult(X0,X1)) != mult(mult(op_d,X0),X1)
    | ? [X0,X1] : mult(X0,mult(X1,op_d)) != mult(mult(X0,X1),op_d)
    | ? [X0,X1] : mult(X0,mult(op_d,X1)) != mult(mult(X0,op_d),X1) ),
    inference(miniscoping,[status(esa)],[f29]) ).

fof(f31,plain,
    ( mult(op_d,mult(sk0_0,sk0_1)) != mult(mult(op_d,sk0_0),sk0_1)
    | mult(sk0_2,mult(sk0_3,op_d)) != mult(mult(sk0_2,sk0_3),op_d)
    | mult(sk0_4,mult(op_d,sk0_5)) != mult(mult(sk0_4,op_d),sk0_5) ),
    inference(skolemization,[status(esa)],[f30]) ).

fof(f32,plain,
    ( mult(op_d,mult(sk0_0,sk0_1)) != mult(mult(op_d,sk0_0),sk0_1)
    | mult(sk0_2,mult(sk0_3,op_d)) != mult(mult(sk0_2,sk0_3),op_d)
    | mult(sk0_4,mult(op_d,sk0_5)) != mult(mult(sk0_4,op_d),sk0_5) ),
    inference(cnf_transformation,[status(esa)],[f31]) ).

fof(f33,plain,
    ( spl0_0
  <=> mult(op_d,mult(sk0_0,sk0_1)) = mult(mult(op_d,sk0_0),sk0_1) ),
    introduced(split_symbol_definition) ).

fof(f35,plain,
    ( mult(op_d,mult(sk0_0,sk0_1)) != mult(mult(op_d,sk0_0),sk0_1)
    | spl0_0 ),
    inference(component_clause,[status(thm)],[f33]) ).

fof(f36,plain,
    ( spl0_1
  <=> mult(sk0_2,mult(sk0_3,op_d)) = mult(mult(sk0_2,sk0_3),op_d) ),
    introduced(split_symbol_definition) ).

fof(f38,plain,
    ( mult(sk0_2,mult(sk0_3,op_d)) != mult(mult(sk0_2,sk0_3),op_d)
    | spl0_1 ),
    inference(component_clause,[status(thm)],[f36]) ).

fof(f39,plain,
    ( spl0_2
  <=> mult(sk0_4,mult(op_d,sk0_5)) = mult(mult(sk0_4,op_d),sk0_5) ),
    introduced(split_symbol_definition) ).

fof(f41,plain,
    ( mult(sk0_4,mult(op_d,sk0_5)) != mult(mult(sk0_4,op_d),sk0_5)
    | spl0_2 ),
    inference(component_clause,[status(thm)],[f39]) ).

fof(f42,plain,
    ( ~ spl0_0
    | ~ spl0_1
    | ~ spl0_2 ),
    inference(split_clause,[status(thm)],[f32,f33,f36,f39]) ).

fof(f3279,plain,
    ! [X0,X1] : mult(X0,mult(X1,mult(X1,unit))) = mult(mult(X0,X1),X1),
    inference(paramodulation,[status(thm)],[f22,f20]) ).

fof(f3280,plain,
    ! [X0,X1] : mult(X0,mult(X1,X1)) = mult(mult(X0,X1),X1),
    inference(forward_demodulation,[status(thm)],[f20,f3279]) ).

fof(f4971,plain,
    ! [X0,X1] : ld(mult(X0,X1),mult(X0,mult(X1,X1))) = X1,
    inference(paramodulation,[status(thm)],[f3280,f17]) ).

fof(f5822,plain,
    op_d = op_c,
    inference(paramodulation,[status(thm)],[f26,f4971]) ).

fof(f5902,plain,
    ( mult(sk0_4,mult(op_d,sk0_5)) != mult(mult(sk0_4,op_c),sk0_5)
    | spl0_2 ),
    inference(backward_demodulation,[status(thm)],[f5822,f41]) ).

fof(f5903,plain,
    ( mult(sk0_4,mult(op_c,sk0_5)) != mult(mult(sk0_4,op_c),sk0_5)
    | spl0_2 ),
    inference(forward_demodulation,[status(thm)],[f5822,f5902]) ).

fof(f5904,plain,
    ( mult(sk0_4,mult(op_c,sk0_5)) != mult(sk0_4,mult(op_c,sk0_5))
    | spl0_2 ),
    inference(forward_demodulation,[status(thm)],[f25,f5903]) ).

fof(f5905,plain,
    ( $false
    | spl0_2 ),
    inference(trivial_equality_resolution,[status(esa)],[f5904]) ).

fof(f5906,plain,
    spl0_2,
    inference(contradiction_clause,[status(thm)],[f5905]) ).

fof(f5908,plain,
    ( mult(op_c,mult(sk0_0,sk0_1)) != mult(mult(op_d,sk0_0),sk0_1)
    | spl0_0 ),
    inference(forward_demodulation,[status(thm)],[f5822,f35]) ).

fof(f5909,plain,
    ( mult(op_c,mult(sk0_0,sk0_1)) != mult(mult(op_c,sk0_0),sk0_1)
    | spl0_0 ),
    inference(forward_demodulation,[status(thm)],[f5822,f5908]) ).

fof(f5910,plain,
    ( mult(op_c,mult(sk0_0,sk0_1)) != mult(op_c,mult(sk0_0,sk0_1))
    | spl0_0 ),
    inference(forward_demodulation,[status(thm)],[f23,f5909]) ).

fof(f5911,plain,
    ( $false
    | spl0_0 ),
    inference(trivial_equality_resolution,[status(esa)],[f5910]) ).

fof(f5912,plain,
    spl0_0,
    inference(contradiction_clause,[status(thm)],[f5911]) ).

fof(f5915,plain,
    ( mult(sk0_2,mult(sk0_3,op_c)) != mult(mult(sk0_2,sk0_3),op_d)
    | spl0_1 ),
    inference(forward_demodulation,[status(thm)],[f5822,f38]) ).

fof(f5916,plain,
    ( mult(sk0_2,mult(sk0_3,op_c)) != mult(mult(sk0_2,sk0_3),op_c)
    | spl0_1 ),
    inference(forward_demodulation,[status(thm)],[f5822,f5915]) ).

fof(f5917,plain,
    ( mult(sk0_2,mult(sk0_3,op_c)) != mult(sk0_2,mult(sk0_3,op_c))
    | spl0_1 ),
    inference(forward_demodulation,[status(thm)],[f24,f5916]) ).

fof(f5918,plain,
    ( $false
    | spl0_1 ),
    inference(trivial_equality_resolution,[status(esa)],[f5917]) ).

fof(f5919,plain,
    spl0_1,
    inference(contradiction_clause,[status(thm)],[f5918]) ).

fof(f5920,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f42,f5906,f5912,f5919]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : GRP702+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.10  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31  % Computer : n017.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit : 300
% 0.10/0.31  % WCLimit  : 300
% 0.10/0.31  % DateTime : Tue May 30 10:55:55 EDT 2023
% 0.10/0.31  % CPUTime  : 
% 0.15/0.31  % Drodi V3.5.1
% 0.15/0.50  % Refutation found
% 0.15/0.50  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.15/0.50  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.52  % Elapsed time: 0.206403 seconds
% 0.15/0.52  % CPU time: 1.041239 seconds
% 0.15/0.52  % Memory used: 62.156 MB
%------------------------------------------------------------------------------