TSTP Solution File: NUM788_8 by Leo-III-SAT---1.7.10

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.10
% Problem  : NUM788_8 : TPTP v8.1.2. Released v8.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n005.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 May  7 10:45:43 EDT 2024

% Result   : Theorem 2.49s 1.61s
% Output   : Refutation 2.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   27 (   7 unt;   6 typ;   0 def)
%            Number of atoms       :   51 (   2 equ;   0 cnn)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  157 (  39   ~;   7   |;   0   &;  92   @)
%                                         (   0 <=>;  19  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   6 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    6 (   6   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   20 (   0   ^  20   !;   0   ?;  20   :)

% Comments : 
%------------------------------------------------------------------------------
thf(rat_type,type,
    rat: $tType ).

thf(x0_type,type,
    x0: rat ).

thf(y0_type,type,
    y0: rat ).

thf(more_type,type,
    more: rat > rat > $o ).

thf(less_type,type,
    less: rat > rat > $o ).

thf(is_type,type,
    is: rat > rat > $o ).

thf(1,conjecture,
    ~ ( ~ ( less @ x0 @ y0 )
     => ( is @ x0 @ y0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz81g) ).

thf(2,negated_conjecture,
    ~ ~ ( ~ ( less @ x0 @ y0 )
       => ( is @ x0 @ y0 ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(6,plain,
    ~ ~ ( ~ ( less @ x0 @ y0 )
       => ( is @ x0 @ y0 ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(7,plain,
    ( ~ ( less @ x0 @ y0 )
   => ( is @ x0 @ y0 ) ),
    inference(polarity_switch,[status(thm)],[6]) ).

thf(8,plain,
    ( ( less @ x0 @ y0 )
    | ( is @ x0 @ y0 ) ),
    inference(cnf,[status(esa)],[7]) ).

thf(3,axiom,
    more @ x0 @ y0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).

thf(9,plain,
    more @ x0 @ y0,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(5,axiom,
    ! [A: rat,B: rat] :
      ~ ( ( ( is @ A @ B )
         => ~ ( more @ A @ B ) )
       => ~ ~ ( ( ( more @ A @ B )
               => ~ ( less @ A @ B ) )
             => ~ ( ( less @ A @ B )
                 => ~ ( is @ A @ B ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz81b) ).

thf(11,plain,
    ! [A: rat,B: rat] :
      ~ ( ( ( is @ A @ B )
         => ~ ( more @ A @ B ) )
       => ( ( ( more @ A @ B )
           => ~ ( less @ A @ B ) )
         => ~ ( ( less @ A @ B )
             => ~ ( is @ A @ B ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(12,plain,
    ~ ( ! [A: rat,B: rat] :
          ( ( is @ A @ B )
         => ~ ( more @ A @ B ) )
     => ( ! [A: rat,B: rat] :
            ( ( more @ A @ B )
           => ~ ( less @ A @ B ) )
       => ~ ! [A: rat,B: rat] :
              ( ( less @ A @ B )
             => ~ ( is @ A @ B ) ) ) ),
    inference(miniscope,[status(thm)],[11]) ).

thf(15,plain,
    ! [B: rat,A: rat] :
      ( ~ ( is @ A @ B )
      | ~ ( more @ A @ B ) ),
    inference(cnf,[status(esa)],[12]) ).

thf(20,plain,
    ! [B: rat,A: rat] :
      ( ~ ( is @ A @ B )
      | ( ( more @ x0 @ y0 )
       != ( more @ A @ B ) ) ),
    inference(paramod_ordered,[status(thm)],[9,15]) ).

thf(21,plain,
    ~ ( is @ x0 @ y0 ),
    inference(pattern_uni,[status(thm)],[20:[bind(A,$thf( x0 )),bind(B,$thf( y0 ))]]) ).

thf(22,plain,
    ( ( less @ x0 @ y0 )
    | $false ),
    inference(rewrite,[status(thm)],[8,21]) ).

thf(23,plain,
    less @ x0 @ y0,
    inference(simp,[status(thm)],[22]) ).

thf(14,plain,
    ! [B: rat,A: rat] :
      ( ~ ( more @ A @ B )
      | ~ ( less @ A @ B ) ),
    inference(cnf,[status(esa)],[12]) ).

thf(17,plain,
    ! [B: rat,A: rat] :
      ( ~ ( more @ A @ B )
      | ~ ( less @ A @ B ) ),
    inference(simp,[status(thm)],[14]) ).

thf(26,plain,
    ! [B: rat,A: rat] :
      ( ~ ( more @ A @ B )
      | ( ( less @ x0 @ y0 )
       != ( less @ A @ B ) ) ),
    inference(paramod_ordered,[status(thm)],[23,17]) ).

thf(27,plain,
    ~ ( more @ x0 @ y0 ),
    inference(pattern_uni,[status(thm)],[26:[bind(A,$thf( x0 )),bind(B,$thf( y0 ))]]) ).

thf(30,plain,
    ~ $true,
    inference(rewrite,[status(thm)],[27,9]) ).

thf(31,plain,
    $false,
    inference(simp,[status(thm)],[30]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM788_8 : TPTP v8.1.2. Released v8.0.0.
% 0.14/0.15  % Command  : run_Leo-III %s %d
% 0.16/0.36  % Computer : n005.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit : 300
% 0.16/0.36  % WCLimit  : 300
% 0.16/0.36  % DateTime : Mon May  6 19:58:24 EDT 2024
% 0.16/0.36  % CPUTime  : 
% 1.00/0.89  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.14/1.02  % [INFO] 	 Parsing done (121ms). 
% 1.14/1.03  % [INFO] 	 Running in sequential loop mode. 
% 1.75/1.23  % [INFO] 	 nitpick registered as external prover. 
% 1.75/1.24  % [INFO] 	 Scanning for conjecture ... 
% 1.78/1.28  % [INFO] 	 Found a conjecture and 3 axioms. Running axiom selection ... 
% 1.78/1.30  % [INFO] 	 Axiom selection finished. Selected 3 axioms (removed 0 axioms). 
% 1.98/1.32  % [INFO] 	 Problem is typed first-order (TPTP TFF). 
% 1.98/1.32  % [INFO] 	 Type checking passed. 
% 1.98/1.32  % [CONFIG] 	 Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>.  Searching for refutation ... 
% 2.49/1.61  % [INFO] 	 Killing All external provers ... 
% 2.49/1.61  % Time passed: 1092ms (effective reasoning time: 580ms)
% 2.49/1.61  % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 2.49/1.61  % Axioms used in derivation (2): m, satz81b
% 2.49/1.61  % No. of inferences in proof: 21
% 2.49/1.61  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1092 ms resp. 580 ms w/o parsing
% 2.72/1.64  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.72/1.64  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------