TSTP Solution File: FLD067-4 by Drodi---3.5.1

View Problem - Process Solution

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

% Computer : n013.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:07:09 EDT 2023

% Result   : Unsatisfiable 0.06s 0.29s
% Output   : CNFRefutation 0.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   29 (  11 unt;   0 def)
%            Number of atoms       :   54 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   50 (  25   ~;  23   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   3 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-1 aty)
%            Number of variables   :   27 (;  27   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [X] :
      ( sum(additive_inverse(X),X,additive_identity)
      | ~ defined(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f5,axiom,
    ! [Y,X,Z] :
      ( sum(Y,X,Z)
      | ~ sum(X,Y,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f24,axiom,
    ! [U,V,X,Y,Z] :
      ( less_or_equal(U,V)
      | ~ less_or_equal(X,Y)
      | ~ sum(X,Z,U)
      | ~ sum(Y,Z,V) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

fof(f30,negated_conjecture,
    less_or_equal(a,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f31,negated_conjecture,
    sum(b,additive_inverse(a),u),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f32,negated_conjecture,
    ~ less_or_equal(additive_identity,u),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f38,plain,
    ! [X0] :
      ( sum(additive_inverse(X0),X0,additive_identity)
      | ~ defined(X0) ),
    inference(cnf_transformation,[status(esa)],[f4]) ).

fof(f39,plain,
    ! [X0,X1,X2] :
      ( sum(X0,X1,X2)
      | ~ sum(X1,X0,X2) ),
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f68,plain,
    ! [V,Y,Z] :
      ( ! [U,X] :
          ( less_or_equal(U,V)
          | ~ less_or_equal(X,Y)
          | ~ sum(X,Z,U) )
      | ~ sum(Y,Z,V) ),
    inference(miniscoping,[status(esa)],[f24]) ).

fof(f69,plain,
    ! [X0,X1,X2,X3,X4] :
      ( less_or_equal(X0,X1)
      | ~ less_or_equal(X2,X3)
      | ~ sum(X2,X4,X0)
      | ~ sum(X3,X4,X1) ),
    inference(cnf_transformation,[status(esa)],[f68]) ).

fof(f72,plain,
    defined(a),
    inference(cnf_transformation,[status(esa)],[f27]) ).

fof(f75,plain,
    less_or_equal(a,b),
    inference(cnf_transformation,[status(esa)],[f30]) ).

fof(f76,plain,
    sum(b,additive_inverse(a),u),
    inference(cnf_transformation,[status(esa)],[f31]) ).

fof(f77,plain,
    ~ less_or_equal(additive_identity,u),
    inference(cnf_transformation,[status(esa)],[f32]) ).

fof(f131,plain,
    ( spl0_9
  <=> less_or_equal(additive_identity,u) ),
    introduced(split_symbol_definition) ).

fof(f132,plain,
    ( less_or_equal(additive_identity,u)
    | ~ spl0_9 ),
    inference(component_clause,[status(thm)],[f131]) ).

fof(f139,plain,
    ( $false
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[status(thm)],[f132,f77]) ).

fof(f140,plain,
    ~ spl0_9,
    inference(contradiction_clause,[status(thm)],[f139]) ).

fof(f308,plain,
    ! [X0,X1] :
      ( less_or_equal(X0,u)
      | ~ less_or_equal(X1,b)
      | ~ sum(X1,additive_inverse(a),X0) ),
    inference(resolution,[status(thm)],[f69,f76]) ).

fof(f581,plain,
    ! [X0] :
      ( less_or_equal(X0,u)
      | ~ sum(a,additive_inverse(a),X0) ),
    inference(resolution,[status(thm)],[f308,f75]) ).

fof(f585,plain,
    ( spl0_79
  <=> defined(a) ),
    introduced(split_symbol_definition) ).

fof(f587,plain,
    ( ~ defined(a)
    | spl0_79 ),
    inference(component_clause,[status(thm)],[f585]) ).

fof(f594,plain,
    ! [X0] :
      ( less_or_equal(X0,u)
      | ~ sum(additive_inverse(a),a,X0) ),
    inference(resolution,[status(thm)],[f581,f39]) ).

fof(f596,plain,
    ( less_or_equal(additive_identity,u)
    | ~ defined(a) ),
    inference(resolution,[status(thm)],[f594,f38]) ).

fof(f597,plain,
    ( spl0_9
    | ~ spl0_79 ),
    inference(split_clause,[status(thm)],[f596,f131,f585]) ).

fof(f606,plain,
    ( $false
    | spl0_79 ),
    inference(forward_subsumption_resolution,[status(thm)],[f587,f72]) ).

fof(f607,plain,
    spl0_79,
    inference(contradiction_clause,[status(thm)],[f606]) ).

fof(f608,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f140,f597,f607]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.07  % Problem  : FLD067-4 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.04/0.07  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.06/0.26  % Computer : n013.cluster.edu
% 0.06/0.26  % Model    : x86_64 x86_64
% 0.06/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26  % Memory   : 8042.1875MB
% 0.06/0.26  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26  % CPULimit : 300
% 0.06/0.26  % WCLimit  : 300
% 0.06/0.26  % DateTime : Tue May 30 10:56:49 EDT 2023
% 0.06/0.26  % CPUTime  : 
% 0.06/0.27  % Drodi V3.5.1
% 0.06/0.29  % Refutation found
% 0.06/0.29  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.06/0.29  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.06/0.30  % Elapsed time: 0.035276 seconds
% 0.06/0.30  % CPU time: 0.173181 seconds
% 0.06/0.30  % Memory used: 3.293 MB
%------------------------------------------------------------------------------