TSTP Solution File: FLD037-1 by Drodi---3.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : FLD037-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n009.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:06:58 EDT 2023

% Result   : Unsatisfiable 0.19s 0.60s
% Output   : CNFRefutation 1.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   20
% Syntax   : Number of formulae    :   67 (  19 unt;   0 def)
%            Number of atoms       :  141 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  136 (  62   ~;  67   |;   0   &)
%                                         (   7 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   11 (  10 usr;   8 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   46 (;  46   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f7,axiom,
    ! [X] :
      ( equalish(multiply(X,multiplicative_inverse(X)),multiplicative_identity)
      | ~ defined(X)
      | equalish(X,additive_identity) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f11,axiom,
    defined(additive_identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f15,axiom,
    ! [X] :
      ( defined(multiplicative_inverse(X))
      | ~ defined(X)
      | equalish(X,additive_identity) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f18,axiom,
    ! [X,Y] :
      ( less_or_equal(X,Y)
      | less_or_equal(Y,X)
      | ~ defined(X)
      | ~ defined(Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f21,axiom,
    ! [X] :
      ( equalish(X,X)
      | ~ defined(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f22,axiom,
    ! [X,Y] :
      ( equalish(X,Y)
      | ~ equalish(Y,X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f23,axiom,
    ! [X,Z,Y] :
      ( equalish(X,Z)
      | ~ equalish(X,Y)
      | ~ equalish(Y,Z) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f25,axiom,
    ! [X,Z,Y] :
      ( equalish(multiply(X,Z),multiply(Y,Z))
      | ~ defined(Z)
      | ~ equalish(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f28,hypothesis,
    defined(a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f29,hypothesis,
    defined(b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f30,negated_conjecture,
    ~ equalish(a,additive_identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f31,negated_conjecture,
    equalish(a,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f32,negated_conjecture,
    ~ equalish(multiplicative_identity,multiply(b,multiplicative_inverse(a))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f42,plain,
    ! [X0] :
      ( equalish(multiply(X0,multiplicative_inverse(X0)),multiplicative_identity)
      | ~ defined(X0)
      | equalish(X0,additive_identity) ),
    inference(cnf_transformation,[status(esa)],[f7]) ).

fof(f49,plain,
    defined(additive_identity),
    inference(cnf_transformation,[status(esa)],[f11]) ).

fof(f54,plain,
    ! [X0] :
      ( defined(multiplicative_inverse(X0))
      | ~ defined(X0)
      | equalish(X0,additive_identity) ),
    inference(cnf_transformation,[status(esa)],[f15]) ).

fof(f58,plain,
    ! [Y] :
      ( ! [X] :
          ( less_or_equal(X,Y)
          | less_or_equal(Y,X)
          | ~ defined(X) )
      | ~ defined(Y) ),
    inference(miniscoping,[status(esa)],[f18]) ).

fof(f59,plain,
    ! [X0,X1] :
      ( less_or_equal(X0,X1)
      | less_or_equal(X1,X0)
      | ~ defined(X0)
      | ~ defined(X1) ),
    inference(cnf_transformation,[status(esa)],[f58]) ).

fof(f64,plain,
    ! [X0] :
      ( equalish(X0,X0)
      | ~ defined(X0) ),
    inference(cnf_transformation,[status(esa)],[f21]) ).

fof(f65,plain,
    ! [X0,X1] :
      ( equalish(X0,X1)
      | ~ equalish(X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f22]) ).

fof(f66,plain,
    ! [Z,Y] :
      ( ! [X] :
          ( equalish(X,Z)
          | ~ equalish(X,Y) )
      | ~ equalish(Y,Z) ),
    inference(miniscoping,[status(esa)],[f23]) ).

fof(f67,plain,
    ! [X0,X1,X2] :
      ( equalish(X0,X1)
      | ~ equalish(X0,X2)
      | ~ equalish(X2,X1) ),
    inference(cnf_transformation,[status(esa)],[f66]) ).

fof(f70,plain,
    ! [X,Y] :
      ( ! [Z] :
          ( equalish(multiply(X,Z),multiply(Y,Z))
          | ~ defined(Z) )
      | ~ equalish(X,Y) ),
    inference(miniscoping,[status(esa)],[f25]) ).

fof(f71,plain,
    ! [X0,X1,X2] :
      ( equalish(multiply(X0,X1),multiply(X2,X1))
      | ~ defined(X1)
      | ~ equalish(X0,X2) ),
    inference(cnf_transformation,[status(esa)],[f70]) ).

fof(f75,plain,
    defined(a),
    inference(cnf_transformation,[status(esa)],[f28]) ).

fof(f76,plain,
    defined(b),
    inference(cnf_transformation,[status(esa)],[f29]) ).

fof(f77,plain,
    ~ equalish(a,additive_identity),
    inference(cnf_transformation,[status(esa)],[f30]) ).

fof(f78,plain,
    equalish(a,b),
    inference(cnf_transformation,[status(esa)],[f31]) ).

fof(f79,plain,
    ~ equalish(multiplicative_identity,multiply(b,multiplicative_inverse(a))),
    inference(cnf_transformation,[status(esa)],[f32]) ).

fof(f81,plain,
    equalish(b,a),
    inference(resolution,[status(thm)],[f65,f78]) ).

fof(f88,plain,
    ! [X0] :
      ( ~ defined(X0)
      | equalish(X0,additive_identity)
      | equalish(multiplicative_identity,multiply(X0,multiplicative_inverse(X0))) ),
    inference(resolution,[status(thm)],[f42,f65]) ).

fof(f90,plain,
    ! [X0] :
      ( ~ equalish(multiplicative_identity,X0)
      | ~ equalish(X0,multiply(b,multiplicative_inverse(a))) ),
    inference(resolution,[status(thm)],[f67,f79]) ).

fof(f91,plain,
    ! [X0] :
      ( ~ equalish(a,X0)
      | ~ equalish(X0,additive_identity) ),
    inference(resolution,[status(thm)],[f67,f77]) ).

fof(f92,plain,
    ! [X0,X1,X2] :
      ( ~ equalish(X0,X1)
      | ~ equalish(X1,X2)
      | equalish(X2,X0) ),
    inference(resolution,[status(thm)],[f67,f65]) ).

fof(f96,plain,
    ( spl0_1
  <=> defined(additive_identity) ),
    introduced(split_symbol_definition) ).

fof(f98,plain,
    ( ~ defined(additive_identity)
    | spl0_1 ),
    inference(component_clause,[status(thm)],[f96]) ).

fof(f107,plain,
    ( spl0_3
  <=> equalish(a,additive_identity) ),
    introduced(split_symbol_definition) ).

fof(f110,plain,
    ( ~ equalish(a,additive_identity)
    | ~ defined(additive_identity) ),
    inference(resolution,[status(thm)],[f91,f64]) ).

fof(f111,plain,
    ( ~ spl0_3
    | ~ spl0_1 ),
    inference(split_clause,[status(thm)],[f110,f107,f96]) ).

fof(f130,plain,
    ( $false
    | spl0_1 ),
    inference(forward_subsumption_resolution,[status(thm)],[f98,f49]) ).

fof(f131,plain,
    spl0_1,
    inference(contradiction_clause,[status(thm)],[f130]) ).

fof(f138,plain,
    ( spl0_8
  <=> defined(a) ),
    introduced(split_symbol_definition) ).

fof(f140,plain,
    ( ~ defined(a)
    | spl0_8 ),
    inference(component_clause,[status(thm)],[f138]) ).

fof(f213,plain,
    ( spl0_20
  <=> defined(b) ),
    introduced(split_symbol_definition) ).

fof(f215,plain,
    ( ~ defined(b)
    | spl0_20 ),
    inference(component_clause,[status(thm)],[f213]) ).

fof(f281,plain,
    ( $false
    | spl0_8 ),
    inference(forward_subsumption_resolution,[status(thm)],[f140,f75]) ).

fof(f282,plain,
    spl0_8,
    inference(contradiction_clause,[status(thm)],[f281]) ).

fof(f380,plain,
    ( $false
    | spl0_20 ),
    inference(forward_subsumption_resolution,[status(thm)],[f215,f76]) ).

fof(f381,plain,
    spl0_20,
    inference(contradiction_clause,[status(thm)],[f380]) ).

fof(f466,plain,
    ! [X0] :
      ( ~ equalish(X0,b)
      | equalish(a,X0) ),
    inference(resolution,[status(thm)],[f92,f81]) ).

fof(f485,plain,
    ( spl0_62
  <=> equalish(a,b) ),
    introduced(split_symbol_definition) ).

fof(f488,plain,
    ( equalish(a,b)
    | ~ defined(b) ),
    inference(resolution,[status(thm)],[f466,f64]) ).

fof(f489,plain,
    ( spl0_62
    | ~ spl0_20 ),
    inference(split_clause,[status(thm)],[f488,f485,f213]) ).

fof(f778,plain,
    ! [X0,X1,X2] :
      ( equalish(multiply(X0,multiplicative_inverse(X1)),multiply(X2,multiplicative_inverse(X1)))
      | ~ equalish(X0,X2)
      | ~ defined(X1)
      | equalish(X1,additive_identity) ),
    inference(resolution,[status(thm)],[f71,f54]) ).

fof(f790,plain,
    ! [X0] :
      ( ~ defined(X0)
      | equalish(X0,additive_identity)
      | ~ equalish(multiply(X0,multiplicative_inverse(X0)),multiply(b,multiplicative_inverse(a))) ),
    inference(resolution,[status(thm)],[f88,f90]) ).

fof(f847,plain,
    ! [X0] :
      ( less_or_equal(X0,b)
      | less_or_equal(b,X0)
      | ~ defined(X0) ),
    inference(resolution,[status(thm)],[f59,f76]) ).

fof(f879,plain,
    ( spl0_104
  <=> less_or_equal(b,b) ),
    introduced(split_symbol_definition) ).

fof(f882,plain,
    ( less_or_equal(b,b)
    | less_or_equal(b,b) ),
    inference(resolution,[status(thm)],[f847,f76]) ).

fof(f883,plain,
    spl0_104,
    inference(split_clause,[status(thm)],[f882,f879]) ).

fof(f919,plain,
    ( spl0_112
  <=> equalish(b,additive_identity) ),
    introduced(split_symbol_definition) ).

fof(f920,plain,
    ( equalish(b,additive_identity)
    | ~ spl0_112 ),
    inference(component_clause,[status(thm)],[f919]) ).

fof(f944,plain,
    ( ~ equalish(a,b)
    | ~ spl0_112 ),
    inference(resolution,[status(thm)],[f920,f91]) ).

fof(f945,plain,
    ( $false
    | ~ spl0_112 ),
    inference(forward_subsumption_resolution,[status(thm)],[f944,f78]) ).

fof(f946,plain,
    ~ spl0_112,
    inference(contradiction_clause,[status(thm)],[f945]) ).

fof(f1306,plain,
    ( ~ defined(a)
    | equalish(a,additive_identity)
    | ~ equalish(a,b)
    | ~ defined(a)
    | equalish(a,additive_identity) ),
    inference(resolution,[status(thm)],[f790,f778]) ).

fof(f1307,plain,
    ( ~ spl0_8
    | spl0_3
    | ~ spl0_62 ),
    inference(split_clause,[status(thm)],[f1306,f138,f107,f485]) ).

fof(f1309,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f111,f131,f282,f381,f489,f883,f946,f1307]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : FLD037-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.03/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.34  % Computer : n009.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Tue May 30 10:55:31 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  % Drodi V3.5.1
% 0.19/0.60  % Refutation found
% 0.19/0.60  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.19/0.60  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 1.18/0.62  % Elapsed time: 0.276452 seconds
% 1.18/0.62  % CPU time: 1.378444 seconds
% 1.18/0.62  % Memory used: 18.662 MB
%------------------------------------------------------------------------------