TSTP Solution File: SWV006-1 by Drodi---3.6.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : SWV006-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n018.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 : Tue Apr 30 20:45:45 EDT 2024

% Result   : Unsatisfiable 0.20s 0.36s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   40 (  13 unt;   0 def)
%            Number of atoms       :   76 (   5 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   69 (  33   ~;  32   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   5 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-1 aty)
%            Number of variables   :   25 (  25   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f6,axiom,
    ! [X] : less_than(X,successor(X)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

fof(f8,axiom,
    ! [X,Y] :
      ( less_than(X,Y)
      | less_than(Y,X)
      | X = Y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f9,axiom,
    ! [X] : ~ less_than(X,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

fof(f15,negated_conjecture,
    less_than(i,n),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f17,negated_conjecture,
    less_than(a(i),a(m)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f18,negated_conjecture,
    ! [X] :
      ( less_than(X,i)
      | ~ less_than(X,successor(n))
      | ~ less_than(a(X),a(m)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f26,plain,
    ! [X0] : less_than(X0,successor(X0)),
    inference(cnf_transformation,[status(esa)],[f6]) ).

fof(f27,plain,
    ! [Z,Y] :
      ( ! [X] :
          ( less_than(X,Z)
          | ~ less_than(X,Y) )
      | ~ less_than(Y,Z) ),
    inference(miniscoping,[status(esa)],[f7]) ).

fof(f28,plain,
    ! [X0,X1,X2] :
      ( less_than(X0,X1)
      | ~ less_than(X0,X2)
      | ~ less_than(X2,X1) ),
    inference(cnf_transformation,[status(esa)],[f27]) ).

fof(f29,plain,
    ! [X0,X1] :
      ( less_than(X0,X1)
      | less_than(X1,X0)
      | X0 = X1 ),
    inference(cnf_transformation,[status(esa)],[f8]) ).

fof(f30,plain,
    ! [X0] : ~ less_than(X0,X0),
    inference(cnf_transformation,[status(esa)],[f9]) ).

fof(f31,plain,
    ! [X0,X1] :
      ( ~ less_than(X0,X1)
      | ~ less_than(X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f10]) ).

fof(f38,plain,
    less_than(i,n),
    inference(cnf_transformation,[status(esa)],[f15]) ).

fof(f40,plain,
    less_than(a(i),a(m)),
    inference(cnf_transformation,[status(esa)],[f17]) ).

fof(f41,plain,
    ! [X0] :
      ( less_than(X0,i)
      | ~ less_than(X0,successor(n))
      | ~ less_than(a(X0),a(m)) ),
    inference(cnf_transformation,[status(esa)],[f18]) ).

fof(f51,plain,
    ( spl0_2
  <=> less_than(i,i) ),
    introduced(split_symbol_definition) ).

fof(f52,plain,
    ( less_than(i,i)
    | ~ spl0_2 ),
    inference(component_clause,[status(thm)],[f51]) ).

fof(f54,plain,
    ( spl0_3
  <=> less_than(i,successor(n)) ),
    introduced(split_symbol_definition) ).

fof(f56,plain,
    ( ~ less_than(i,successor(n))
    | spl0_3 ),
    inference(component_clause,[status(thm)],[f54]) ).

fof(f57,plain,
    ( less_than(i,i)
    | ~ less_than(i,successor(n)) ),
    inference(resolution,[status(thm)],[f41,f40]) ).

fof(f58,plain,
    ( spl0_2
    | ~ spl0_3 ),
    inference(split_clause,[status(thm)],[f57,f51,f54]) ).

fof(f77,plain,
    ! [X0] : ~ less_than(successor(X0),X0),
    inference(resolution,[status(thm)],[f31,f26]) ).

fof(f81,plain,
    ! [X0] :
      ( less_than(X0,n)
      | ~ less_than(X0,i) ),
    inference(resolution,[status(thm)],[f28,f38]) ).

fof(f162,plain,
    ( spl0_13
  <=> less_than(successor(n),i) ),
    introduced(split_symbol_definition) ).

fof(f163,plain,
    ( less_than(successor(n),i)
    | ~ spl0_13 ),
    inference(component_clause,[status(thm)],[f162]) ).

fof(f165,plain,
    ( spl0_14
  <=> successor(n) = i ),
    introduced(split_symbol_definition) ).

fof(f166,plain,
    ( successor(n) = i
    | ~ spl0_14 ),
    inference(component_clause,[status(thm)],[f165]) ).

fof(f168,plain,
    ( less_than(successor(n),i)
    | successor(n) = i
    | spl0_3 ),
    inference(resolution,[status(thm)],[f56,f29]) ).

fof(f169,plain,
    ( spl0_13
    | spl0_14
    | spl0_3 ),
    inference(split_clause,[status(thm)],[f168,f162,f165,f54]) ).

fof(f170,plain,
    ( $false
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[status(thm)],[f52,f30]) ).

fof(f171,plain,
    ~ spl0_2,
    inference(contradiction_clause,[status(thm)],[f170]) ).

fof(f173,plain,
    ( less_than(successor(n),n)
    | ~ spl0_13 ),
    inference(resolution,[status(thm)],[f163,f81]) ).

fof(f174,plain,
    ( $false
    | ~ spl0_13 ),
    inference(forward_subsumption_resolution,[status(thm)],[f173,f77]) ).

fof(f175,plain,
    ~ spl0_13,
    inference(contradiction_clause,[status(thm)],[f174]) ).

fof(f180,plain,
    ( ~ less_than(i,n)
    | ~ spl0_14 ),
    inference(paramodulation,[status(thm)],[f166,f77]) ).

fof(f181,plain,
    ( $false
    | ~ spl0_14 ),
    inference(forward_subsumption_resolution,[status(thm)],[f180,f38]) ).

fof(f182,plain,
    ~ spl0_14,
    inference(contradiction_clause,[status(thm)],[f181]) ).

fof(f183,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f58,f169,f171,f175,f182]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWV006-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.34  % Computer : n018.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 Apr 30 00:51:13 EDT 2024
% 0.14/0.34  % CPUTime  : 
% 0.20/0.35  % Drodi V3.6.0
% 0.20/0.36  % Refutation found
% 0.20/0.36  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.20/0.36  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.20/0.37  % Elapsed time: 0.020098 seconds
% 0.20/0.37  % CPU time: 0.031690 seconds
% 0.20/0.37  % Total memory used: 12.842 MB
% 0.20/0.37  % Net memory used: 12.742 MB
%------------------------------------------------------------------------------