↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : NUM672^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n020.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Sep 30 08:19:16 AM UTC 2026

% Result   : Theorem 0.19s 0.28s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   33 (  15 unt;   0 typ;   0 def)
%            Number of atoms       :  117 (  33 equ;   0 cnn)
%            Maximal formula atoms :    2 (   3 avg)
%            Number of connectives :  185 (  15   ~;   9   |;   0   &; 152   @)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   39 (   0   ^;  39   !;   0   ?;  39   :)

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

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

thf(func_def_0,type,
    x: nat ).

thf(func_def_1,type,
    y: nat ).

thf(func_def_2,type,
    z: nat ).

thf(func_def_3,type,
    less: nat > nat > $o ).

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

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

thf(f1,axiom,
    less @ x @ y,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).

thf(f2,axiom,
    ! [X0: nat,X1: nat] :
      ( ( more @ X0 @ X1 )
     => ( less @ X1 @ X0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz11) ).

thf(f3,axiom,
    ! [X0: nat,X1: nat,X2: nat] :
      ( ( more @ X0 @ X1 )
     => ( more @ ( pl @ X0 @ X2 ) @ ( pl @ X1 @ X2 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz19a) ).

thf(f4,axiom,
    ! [X0: nat,X1: nat] :
      ( ( less @ X0 @ X1 )
     => ( more @ X1 @ X0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz12) ).

thf(f5,conjecture,
    less @ ( pl @ x @ z ) @ ( pl @ y @ z ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz19c) ).

thf(f6,negated_conjecture,
    ~ ( less @ ( pl @ x @ z ) @ ( pl @ y @ z ) ),
    inference(negated_conjecture,[status(cth)],[f5]) ).

thf(f7,plain,
    less @ x @ y,
    inference(rectify,[],[f1]) ).

thf(f8,plain,
    ( ( less @ x @ y )
    = $true ),
    inference(fool_elimination,[],[f7]) ).

thf(f9,plain,
    ! [X0: nat,X1: nat] :
      ( ( more @ X0 @ X1 )
     => ( less @ X1 @ X0 ) ),
    inference(rectify,[],[f2]) ).

thf(f10,plain,
    ! [X0: nat,X1: nat] :
      ( ( ( more @ X0 @ X1 )
        = $true )
     => ( ( less @ X1 @ X0 )
        = $true ) ),
    inference(fool_elimination,[],[f9]) ).

thf(f11,plain,
    ! [X0: nat,X1: nat,X2: nat] :
      ( ( more @ X0 @ X1 )
     => ( more @ ( pl @ X0 @ X2 ) @ ( pl @ X1 @ X2 ) ) ),
    inference(rectify,[],[f3]) ).

thf(f12,plain,
    ! [X0: nat,X1: nat,X2: nat] :
      ( ( ( more @ X0 @ X1 )
        = $true )
     => ( ( more @ ( pl @ X0 @ X2 ) @ ( pl @ X1 @ X2 ) )
        = $true ) ),
    inference(fool_elimination,[],[f11]) ).

thf(f13,plain,
    ! [X0: nat,X1: nat] :
      ( ( less @ X0 @ X1 )
     => ( more @ X1 @ X0 ) ),
    inference(rectify,[],[f4]) ).

thf(f14,plain,
    ! [X0: nat,X1: nat] :
      ( ( ( less @ X0 @ X1 )
        = $true )
     => ( ( more @ X1 @ X0 )
        = $true ) ),
    inference(fool_elimination,[],[f13]) ).

thf(f15,plain,
    ~ ( less @ ( pl @ x @ z ) @ ( pl @ y @ z ) ),
    inference(rectify,[],[f6]) ).

thf(f16,plain,
    ( ( less @ ( pl @ x @ z ) @ ( pl @ y @ z ) )
   != $true ),
    inference(fool_elimination,[],[f15]) ).

thf(f17,plain,
    ( ( less @ ( pl @ x @ z ) @ ( pl @ y @ z ) )
   != $true ),
    inference(flattening,[],[f16]) ).

thf(f18,plain,
    ! [X0: nat,X1: nat] :
      ( ( ( less @ X1 @ X0 )
        = $true )
      | ( ( more @ X0 @ X1 )
       != $true ) ),
    inference(ennf_transformation,[],[f10]) ).

thf(f19,plain,
    ! [X0: nat,X1: nat,X2: nat] :
      ( ( ( more @ ( pl @ X0 @ X2 ) @ ( pl @ X1 @ X2 ) )
        = $true )
      | ( ( more @ X0 @ X1 )
       != $true ) ),
    inference(ennf_transformation,[],[f12]) ).

thf(f20,plain,
    ! [X0: nat,X1: nat] :
      ( ( ( more @ X1 @ X0 )
        = $true )
      | ( ( less @ X0 @ X1 )
       != $true ) ),
    inference(ennf_transformation,[],[f14]) ).

thf(f21,plain,
    ( ( less @ x @ y )
    = $true ),
    inference(cnf_transformation,[],[f8]) ).

thf(f22,plain,
    ! [X0: nat,X1: nat] :
      ( ( ( more @ X0 @ X1 )
       != $true )
      | ( ( less @ X1 @ X0 )
        = $true ) ),
    inference(cnf_transformation,[],[f18]) ).

thf(f23,plain,
    ! [X2: nat,X0: nat,X1: nat] :
      ( ( ( more @ X0 @ X1 )
       != $true )
      | ( ( more @ ( pl @ X0 @ X2 ) @ ( pl @ X1 @ X2 ) )
        = $true ) ),
    inference(cnf_transformation,[],[f19]) ).

thf(f24,plain,
    ! [X0: nat,X1: nat] :
      ( ( ( less @ X0 @ X1 )
       != $true )
      | ( ( more @ X1 @ X0 )
        = $true ) ),
    inference(cnf_transformation,[],[f20]) ).

thf(f25,plain,
    ( ( less @ ( pl @ x @ z ) @ ( pl @ y @ z ) )
   != $true ),
    inference(cnf_transformation,[],[f17]) ).

thf(f43,plain,
    ( ( $true != $true )
    | ( $true
      = ( more @ y @ x ) ) ),
    inference(constrained_superposition,[],[f24,f21]) ).

thf(f45,plain,
    ( $true
    = ( more @ y @ x ) ),
    inference(trivial_inequality_removal,[],[f43]) ).

thf(f49,plain,
    ! [X0: nat] :
      ( ( $true != $true )
      | ( $true
        = ( more @ ( pl @ y @ X0 ) @ ( pl @ x @ X0 ) ) ) ),
    inference(constrained_superposition,[],[f23,f45]) ).

thf(f52,plain,
    ! [X0: nat] :
      ( $true
      = ( more @ ( pl @ y @ X0 ) @ ( pl @ x @ X0 ) ) ),
    inference(trivial_inequality_removal,[],[f49]) ).

thf(f91,plain,
    ! [X0: nat] :
      ( ( $true != $true )
      | ( $true
        = ( less @ ( pl @ x @ X0 ) @ ( pl @ y @ X0 ) ) ) ),
    inference(constrained_superposition,[],[f22,f52]) ).

thf(f92,plain,
    ! [X0: nat] :
      ( $true
      = ( less @ ( pl @ x @ X0 ) @ ( pl @ y @ X0 ) ) ),
    inference(trivial_inequality_removal,[],[f91]) ).

thf(f113,plain,
    $true != $true,
    inference(constrained_superposition,[],[f25,f92]) ).

thf(f116,plain,
    $false,
    inference(trivial_inequality_removal,[],[f113]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM672^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.18  % Computer : n020.cluster.edu
% 0.10/0.18  % Model    : x86_64 x86_64
% 0.10/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18  % Memory   : 8046.5625MB
% 0.10/0.18  % OS       : Linux 6.8.0-71-generic
% 0.10/0.18  % CPULimit : 300
% 0.10/0.18  % WCLimit  : 300
% 0.10/0.18  % DateTime : Tue Sep 29 12:36:19 UTC 2026
% 0.10/0.18  % CPUTime  : 
% 0.10/0.18  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.22  Running first-order model finding
% 0.10/0.22  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.28  % (993776)Will run a generic schedule for satisfiability detection.
% 0.19/0.28  % (993783)% WARNING: option uhcvi not known.
% 0.19/0.28  % (993784)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3482997017:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.28  % (993785)dis+10_1_sil=32000:sp=arity:random_seed=2149248658:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.28  % (993783)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=826866028:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.28  % (993783)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.28  % (993783)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.19/0.28  % (993787)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=948022905:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.28  % (993782)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4184999057_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.28  % Exception at run slice level
% 0.19/0.28  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.28  % (993785) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-993776-993785"...
% 0.19/0.28  % (993787) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-993776-993787"...
% 0.19/0.28  % (993783) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-993776-993783"...
% 0.19/0.28  % (993787)...printing done.
% 0.19/0.28  % (993785)...printing done.
% 0.19/0.28  % (993784) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-993776-993784"...
% 0.19/0.28  % (993787)Refutation found. Thanks to Tanya!
% 0.19/0.28  % SZS status Theorem for theBenchmark
% 0.19/0.28  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.28  % (993787)------------------------------
% 0.19/0.28  % (993787)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.28  % (993787)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.28  % (993787)CaDiCaL version: 2.1.3
% 0.19/0.28  % (993787)Termination reason: Refutation
% 0.19/0.28  % (993787)Time elapsed: 0.005 s
% 0.19/0.28  % (993787)Peak memory usage: 12 MB
% 0.19/0.28  % (993787)Instructions burned: 8 (million)
% 0.19/0.28  % (993776)Success in time 0.05 s
% 0.19/0.28  % Vampire exiting
%------------------------------------------------------------------------------