TSTP Solution File: NUM783^1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : NUM783^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n006.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 21 01:45:53 EDT 2024

% Result   : Theorem 0.13s 0.36s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   22 (   5 unt;   9 typ;   0 def)
%            Number of atoms       :   89 (  10 equ;   0 cnn)
%            Maximal formula atoms :    8 (   6 avg)
%            Number of connectives :  171 (  13   ~;   0   |;   1   &; 153   @)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   12 (  12   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   7 usr;   4 con; 0-3 aty)
%            Number of variables   :   12 (   0   ^  12   !;   0   ?;  12   :)

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

thf(func_def_0,type,
    rat: $tType ).

thf(func_def_1,type,
    x0: rat ).

thf(func_def_2,type,
    y0: rat ).

thf(func_def_3,type,
    or3: $o > $o > $o > $o ).

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

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

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

thf(func_def_7,type,
    ec3: $o > $o > $o > $o ).

thf(f22,plain,
    $false,
    inference(subsumption_resolution,[],[f17,f20]) ).

thf(f20,plain,
    ! [X0: rat,X1: rat] :
      ( ( or3 @ ( is @ X0 @ X1 ) @ ( more @ X0 @ X1 ) @ ( less @ X0 @ X1 ) )
      = $true ),
    inference(cnf_transformation,[],[f15]) ).

thf(f15,plain,
    ! [X0: rat,X1: rat] :
      ( ( ( or3 @ ( is @ X0 @ X1 ) @ ( more @ X0 @ X1 ) @ ( less @ X0 @ X1 ) )
        = $true )
      & ( ( ec3 @ ( is @ X0 @ X1 ) @ ( more @ X0 @ X1 ) @ ( less @ X0 @ X1 ) )
        = $true ) ),
    inference(ennf_transformation,[],[f12]) ).

thf(f12,plain,
    ! [X0: rat,X1: rat] :
      ~ ( ( ( or3 @ ( is @ X0 @ X1 ) @ ( more @ X0 @ X1 ) @ ( less @ X0 @ X1 ) )
          = $true )
       => ( ( ec3 @ ( is @ X0 @ X1 ) @ ( more @ X0 @ X1 ) @ ( less @ X0 @ X1 ) )
         != $true ) ),
    inference(flattening,[],[f7]) ).

thf(f7,plain,
    ! [X0: rat,X1: rat] :
      ~ ( ( ( or3 @ ( is @ X0 @ X1 ) @ ( more @ X0 @ X1 ) @ ( less @ X0 @ X1 ) )
          = $true )
       => ( ( ec3 @ ( is @ X0 @ X1 ) @ ( more @ X0 @ X1 ) @ ( less @ X0 @ X1 ) )
         != $true ) ),
    inference(fool_elimination,[],[f6]) ).

thf(f6,plain,
    ! [X0: rat,X1: rat] :
      ~ ( ( or3 @ ( is @ X0 @ X1 ) @ ( more @ X0 @ X1 ) @ ( less @ X0 @ X1 ) )
       => ~ ( ec3 @ ( is @ X0 @ X1 ) @ ( more @ X0 @ X1 ) @ ( less @ X0 @ X1 ) ) ),
    inference(rectify,[],[f2]) ).

thf(f2,axiom,
    ! [X1: rat,X2: rat] :
      ~ ( ( or3 @ ( is @ X1 @ X2 ) @ ( more @ X1 @ X2 ) @ ( less @ X1 @ X2 ) )
       => ~ ( ec3 @ ( is @ X1 @ X2 ) @ ( more @ X1 @ X2 ) @ ( less @ X1 @ X2 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz81) ).

thf(f17,plain,
    ( ( or3 @ ( is @ x0 @ y0 ) @ ( more @ x0 @ y0 ) @ ( less @ x0 @ y0 ) )
   != $true ),
    inference(cnf_transformation,[],[f13]) ).

thf(f13,plain,
    ( ( or3 @ ( is @ x0 @ y0 ) @ ( more @ x0 @ y0 ) @ ( less @ x0 @ y0 ) )
   != $true ),
    inference(flattening,[],[f9]) ).

thf(f9,plain,
    ( ( or3 @ ( is @ x0 @ y0 ) @ ( more @ x0 @ y0 ) @ ( less @ x0 @ y0 ) )
   != $true ),
    inference(fool_elimination,[],[f8]) ).

thf(f8,plain,
    ~ ( or3 @ ( is @ x0 @ y0 ) @ ( more @ x0 @ y0 ) @ ( less @ x0 @ y0 ) ),
    inference(rectify,[],[f4]) ).

thf(f4,negated_conjecture,
    ~ ( or3 @ ( is @ x0 @ y0 ) @ ( more @ x0 @ y0 ) @ ( less @ x0 @ y0 ) ),
    inference(negated_conjecture,[],[f3]) ).

thf(f3,conjecture,
    or3 @ ( is @ x0 @ y0 ) @ ( more @ x0 @ y0 ) @ ( less @ x0 @ y0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz81a) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : NUM783^1 : TPTP v8.2.0. Released v3.7.0.
% 0.11/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.34  % Computer : n006.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon May 20 03:56:07 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.13/0.34  This is a TH0_THM_NEQ_NAR problem
% 0.13/0.34  Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.36  % (3043)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.13/0.36  % (3042)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.13/0.36  % (3044)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.13/0.36  % (3037)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.13/0.36  % (3042)Refutation not found, incomplete strategy
% 0.13/0.36  % (3042)------------------------------
% 0.13/0.36  % (3042)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36  % (3042)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.36  
% 0.13/0.36  
% 0.13/0.36  % (3042)Memory used [KB]: 5373
% 0.13/0.36  % (3044)First to succeed.
% 0.13/0.36  % (3042)Time elapsed: 0.003 s
% 0.13/0.36  % (3042)Instructions burned: 1 (million)
% 0.13/0.36  % (3042)------------------------------
% 0.13/0.36  % (3042)------------------------------
% 0.13/0.36  % (3043)Also succeeded, but the first one will report.
% 0.13/0.36  % (3044)Refutation found. Thanks to Tanya!
% 0.13/0.36  % SZS status Theorem for theBenchmark
% 0.13/0.36  % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.36  % (3044)------------------------------
% 0.13/0.36  % (3044)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36  % (3044)Termination reason: Refutation
% 0.13/0.36  
% 0.13/0.36  % (3044)Memory used [KB]: 5500
% 0.13/0.36  % (3044)Time elapsed: 0.003 s
% 0.13/0.36  % (3044)Instructions burned: 1 (million)
% 0.13/0.36  % (3044)------------------------------
% 0.13/0.36  % (3044)------------------------------
% 0.13/0.36  % (3036)Success in time 0.015 s
% 0.13/0.37  % Vampire---4.8 exiting
%------------------------------------------------------------------------------