↑ 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  : NUM748^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 : n007.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:26 AM UTC 2026

% Result   : Theorem 0.30s 0.26s
% Output   : Refutation 0.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   18 (  18 unt;   0 typ;   0 def)
%            Number of atoms       :   34 (  12 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :  304 (   8   ~;   0   |;   0   &; 296   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   12 (   9 usr;   4 con; 0-2 aty)
%            Number of variables   :   12 (   0   ^;  12   !;   0   ?;  12   :)

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

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

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

thf(func_def_0,type,
    x: frac ).

thf(func_def_1,type,
    y: frac ).

thf(func_def_2,type,
    eq: frac > frac > $o ).

thf(func_def_3,type,
    fr: nat > nat > frac ).

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

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

thf(func_def_6,type,
    num: frac > nat ).

thf(func_def_7,type,
    den: frac > nat ).

thf(f1,axiom,
    ! [X0: frac] : ( eq @ X0 @ X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz37) ).

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

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

thf(f4,conjecture,
    eq @ ( fr @ ( pl @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( pl @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz58) ).

thf(f5,negated_conjecture,
    ~ ( eq @ ( fr @ ( pl @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( pl @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f4]) ).

thf(f6,plain,
    ! [X0: frac] : ( eq @ X0 @ X0 ),
    inference(rectify,[],[f1]) ).

thf(f7,plain,
    ! [X0: frac] :
      ( ( eq @ X0 @ X0 )
      = $true ),
    inference(fool_elimination,[],[f6]) ).

thf(f8,plain,
    ~ ( eq @ ( fr @ ( pl @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( pl @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ) ),
    inference(rectify,[],[f5]) ).

thf(f9,plain,
    ( ( eq @ ( fr @ ( pl @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( pl @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ) )
   != $true ),
    inference(fool_elimination,[],[f8]) ).

thf(f10,plain,
    ( ( eq @ ( fr @ ( pl @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( pl @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ) )
   != $true ),
    inference(flattening,[],[f9]) ).

thf(f11,plain,
    ! [X0: frac] :
      ( ( eq @ X0 @ X0 )
      = $true ),
    inference(cnf_transformation,[],[f7]) ).

thf(f12,plain,
    ! [X0: nat,X1: nat] :
      ( ( ts @ X0 @ X1 )
      = ( ts @ X1 @ X0 ) ),
    inference(cnf_transformation,[],[f2]) ).

thf(f13,plain,
    ! [X0: nat,X1: nat] :
      ( ( pl @ X0 @ X1 )
      = ( pl @ X1 @ X0 ) ),
    inference(cnf_transformation,[],[f3]) ).

thf(f14,plain,
    ( ( eq @ ( fr @ ( pl @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( pl @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ) )
   != $true ),
    inference(cnf_transformation,[],[f10]) ).

thf(f32,plain,
    ( $true
   != ( eq @ ( fr @ ( pl @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( pl @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) ) ),
    inference(constrained_superposition,[],[f14,f12]) ).

thf(f43,plain,
    ( $true
   != ( eq @ ( fr @ ( pl @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( pl @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) ) ),
    inference(constrained_superposition,[],[f32,f13]) ).

thf(f51,plain,
    $true != $true,
    inference(constrained_superposition,[],[f43,f11]) ).

thf(f52,plain,
    $false,
    inference(trivial_inequality_removal,[],[f51]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM748^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.19  % Computer : n007.cluster.edu
% 0.07/0.19  % Model    : x86_64 x86_64
% 0.07/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19  % Memory   : 8046.5625MB
% 0.07/0.19  % OS       : Linux 6.8.0-71-generic
% 0.07/0.19  % CPULimit : 300
% 0.07/0.19  % WCLimit  : 300
% 0.07/0.19  % DateTime : Tue Sep 29 12:47:47 UTC 2026
% 0.07/0.19  % CPUTime  : 
% 0.07/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22  Running first-order model finding
% 0.07/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.30/0.26  % (3312103)Will run a generic schedule for satisfiability detection.
% 0.30/0.26  % (3312109)% WARNING: option uhcvi not known.
% 0.30/0.26  % (3312114)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=543887028:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.30/0.26  % (3312111)dis+10_1_sil=32000:sp=arity:random_seed=2942005535:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.30/0.26  % (3312112)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3220281865:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.30/0.26  % (3312108)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1912961448_2999 on theBenchmark for (2999ds/0Mi)
% 0.30/0.26  % (3312110)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3240395729:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.30/0.26  % (3312112)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.30/0.26  % Exception at run slice level
% 0.30/0.26  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.30/0.26  % (3312114) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3312103-3312114"...
% 0.30/0.26  % (3312112) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3312103-3312112"...
% 0.30/0.26  % (3312114)...printing done.
% 0.30/0.26  % (3312114)Refutation found. Thanks to Tanya!
% 0.30/0.26  % SZS status Theorem for theBenchmark
% 0.30/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.30/0.26  % (3312114)------------------------------
% 0.30/0.26  % (3312114)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.26  % (3312114)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.26  % (3312114)CaDiCaL version: 2.1.3
% 0.30/0.26  % (3312114)Termination reason: Refutation
% 0.30/0.26  % (3312114)Time elapsed: 0.003 s
% 0.30/0.26  % (3312114)Peak memory usage: 12 MB
% 0.30/0.26  % (3312114)Instructions burned: 8 (million)
% 0.30/0.26  % (3312103)Success in time 0.032 s
% 0.30/0.26  % Vampire exiting
%------------------------------------------------------------------------------