TSTP Solution File: NUM683^1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : NUM683^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n024.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 02:12:50 EDT 2024

% Result   : Theorem 0.14s 0.36s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   35 (  15 unt;  15 typ;   0 def)
%            Number of atoms       :  147 (  15 equ;   0 cnn)
%            Maximal formula atoms :    2 (   7 avg)
%            Number of connectives :   12 (   7   ~;   2   |;   0   &;   0   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   22 (  21   >;   1   *;   0   +;   0  <<)
%            Number of symbols     :   17 (  14 usr;   5 con; 0-6 aty)
%            Number of variables   :   25 (   0   ^  19   !;   0   ?;  25   :)
%                                         (   6  !>;   0  ?*;   0  @-;   0  @+)

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

thf(type_def_6,type,
    sTfun: ( $tType * $tType ) > $tType ).

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

thf(func_def_1,type,
    x: nat ).

thf(func_def_2,type,
    y: nat ).

thf(func_def_3,type,
    z: nat ).

thf(func_def_4,type,
    more: nat > nat > $o ).

thf(func_def_5,type,
    pl: nat > nat > nat ).

thf(func_def_9,type,
    kCOMB: 
      !>[X0: $tType,X1: $tType] : ( X0 > X1 > X0 ) ).

thf(func_def_10,type,
    bCOMB: 
      !>[X0: $tType,X1: $tType,X2: $tType] : ( ( X1 > X2 ) > ( X0 > X1 ) > X0 > X2 ) ).

thf(func_def_11,type,
    vAND: $o > $o > $o ).

thf(func_def_12,type,
    vOR: $o > $o > $o ).

thf(func_def_13,type,
    vIMP: $o > $o > $o ).

thf(func_def_14,type,
    vNOT: $o > $o ).

thf(func_def_15,type,
    vEQ: 
      !>[X0: $tType] : ( X0 > X0 > $o ) ).

thf(f60,plain,
    $false,
    inference(unit_resulting_resolution,[],[f16,f21,f18]) ).

thf(f18,plain,
    ! [X2: nat,X0: nat,X1: nat] :
      ( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X0),X2)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X1),X2)) != $true )
      | ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1) = $true ) ),
    inference(cnf_transformation,[],[f15]) ).

thf(f15,plain,
    ! [X0: nat,X1: nat,X2: nat] :
      ( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1) = $true )
      | ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X0),X2)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X1),X2)) != $true ) ),
    inference(ennf_transformation,[],[f11]) ).

thf(f11,plain,
    ! [X0: nat,X1: nat,X2: nat] :
      ( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X0),X2)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X1),X2)) = $true )
     => ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1) = $true ) ),
    inference(fool_elimination,[],[f10]) ).

thf(f10,plain,
    ! [X0: nat,X1: nat,X2: nat] :
      ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X0),X2)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X1),X2))
     => vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1) ),
    inference(rectify,[],[f2]) ).

thf(f2,axiom,
    ! [X0: nat,X1: nat,X2: nat] :
      ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X0),X2)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X1),X2))
     => vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz20a) ).

thf(f21,plain,
    $true = vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,x),z)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,y),z)),
    inference(forward_demodulation,[],[f20,f17]) ).

thf(f17,plain,
    ! [X0: nat,X1: nat] : ( vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X0),X1) = vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X1),X0) ),
    inference(cnf_transformation,[],[f3]) ).

thf(f3,axiom,
    ! [X0: nat,X1: nat] : ( vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X0),X1) = vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X1),X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz6) ).

thf(f20,plain,
    $true = vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,z),x)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,y),z)),
    inference(forward_demodulation,[],[f19,f17]) ).

thf(f19,plain,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,z),x)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,z),y)) = $true,
    inference(cnf_transformation,[],[f13]) ).

thf(f13,plain,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,z),x)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,z),y)) = $true,
    inference(fool_elimination,[],[f12]) ).

thf(f12,plain,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,z),x)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,z),y)),
    inference(rectify,[],[f1]) ).

thf(f1,axiom,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,z),x)),vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,z),y)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).

thf(f16,plain,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y) != $true,
    inference(cnf_transformation,[],[f14]) ).

thf(f14,plain,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y) != $true,
    inference(flattening,[],[f9]) ).

thf(f9,plain,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y) != $true,
    inference(fool_elimination,[],[f8]) ).

thf(f8,plain,
    ~ vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y),
    inference(rectify,[],[f5]) ).

thf(f5,negated_conjecture,
    ~ vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y),
    inference(negated_conjecture,[],[f4]) ).

thf(f4,conjecture,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz20d) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : NUM683^1 : TPTP v8.2.0. Released v3.7.0.
% 0.03/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.34  % Computer : n024.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   : Mon May 20 03:44:07 EDT 2024
% 0.14/0.34  % CPUTime    : 
% 0.14/0.35  % (32630)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.36  % (32637)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.14/0.36  % (32637)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.14/0.36  % (32637)First to succeed.
% 0.14/0.36  % (32637)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-32630"
% 0.14/0.36  % (32637)Refutation found. Thanks to Tanya!
% 0.14/0.36  % SZS status Theorem for theBenchmark
% 0.14/0.36  % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.36  % (32637)------------------------------
% 0.14/0.36  % (32637)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.36  % (32637)Termination reason: Refutation
% 0.14/0.36  
% 0.14/0.36  % (32637)Memory used [KB]: 766
% 0.14/0.36  % (32637)Time elapsed: 0.003 s
% 0.14/0.36  % (32637)Instructions burned: 6 (million)
% 0.14/0.36  % (32630)Success in time 0.013 s
%------------------------------------------------------------------------------