↑ 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  : NUM759^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 : n002.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:28 AM UTC 2026

% Result   : Theorem 0.22s 0.30s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   36 (  18 unt;   0 typ;   0 def)
%            Number of atoms       :  150 (  44 equ;   0 cnn)
%            Maximal formula atoms :    3 (   4 avg)
%            Number of connectives :  244 (  22   ~;  17   |;   0   &; 196   @)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   49 (   0   ^;  49   !;   0   ?;  49   :)

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

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

thf(func_def_0,type,
    x: frac ).

thf(func_def_1,type,
    y: frac ).

thf(func_def_2,type,
    z: frac ).

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

thf(func_def_4,type,
    pf: frac > frac > frac ).

thf(f1,axiom,
    eq @ ( pf @ z @ x ) @ ( pf @ z @ y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',e) ).

thf(f2,axiom,
    ! [X0: frac,X1: frac,X2: frac] :
      ( ( eq @ ( pf @ X0 @ X2 ) @ ( pf @ X1 @ X2 ) )
     => ( eq @ X0 @ X1 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz63b) ).

thf(f3,axiom,
    ! [X0: frac,X1: frac,X2: frac] :
      ( ( eq @ X0 @ X1 )
     => ( ( eq @ X1 @ X2 )
       => ( eq @ X0 @ X2 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz39) ).

thf(f4,axiom,
    ! [X0: frac,X1: frac] : ( eq @ ( pf @ X0 @ X1 ) @ ( pf @ X1 @ X0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz58) ).

thf(f5,conjecture,
    eq @ x @ y,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz63e) ).

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

thf(f7,plain,
    eq @ ( pf @ z @ x ) @ ( pf @ z @ y ),
    inference(rectify,[],[f1]) ).

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

thf(f9,plain,
    ! [X0: frac,X1: frac,X2: frac] :
      ( ( eq @ ( pf @ X0 @ X2 ) @ ( pf @ X1 @ X2 ) )
     => ( eq @ X0 @ X1 ) ),
    inference(rectify,[],[f2]) ).

thf(f10,plain,
    ! [X0: frac,X1: frac,X2: frac] :
      ( ( ( eq @ ( pf @ X0 @ X2 ) @ ( pf @ X1 @ X2 ) )
        = $true )
     => ( ( eq @ X0 @ X1 )
        = $true ) ),
    inference(fool_elimination,[],[f9]) ).

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

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

thf(f13,plain,
    ! [X0: frac,X1: frac] : ( eq @ ( pf @ X0 @ X1 ) @ ( pf @ X1 @ X0 ) ),
    inference(rectify,[],[f4]) ).

thf(f14,plain,
    ! [X0: frac,X1: frac] :
      ( ( eq @ ( pf @ X0 @ X1 ) @ ( pf @ X1 @ X0 ) )
      = $true ),
    inference(fool_elimination,[],[f13]) ).

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

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

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

thf(f18,plain,
    ! [X0: frac,X1: frac,X2: frac] :
      ( ( ( eq @ X0 @ X1 )
        = $true )
      | ( ( eq @ ( pf @ X0 @ X2 ) @ ( pf @ X1 @ X2 ) )
       != $true ) ),
    inference(ennf_transformation,[],[f10]) ).

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

thf(f20,plain,
    ! [X0: frac,X1: frac,X2: frac] :
      ( ( ( eq @ X0 @ X2 )
        = $true )
      | ( ( eq @ X1 @ X2 )
       != $true )
      | ( ( eq @ X0 @ X1 )
       != $true ) ),
    inference(flattening,[],[f19]) ).

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

thf(f22,plain,
    ! [X2: frac,X0: frac,X1: frac] :
      ( ( ( eq @ ( pf @ X0 @ X2 ) @ ( pf @ X1 @ X2 ) )
       != $true )
      | ( ( eq @ X0 @ X1 )
        = $true ) ),
    inference(cnf_transformation,[],[f18]) ).

thf(f23,plain,
    ! [X2: frac,X0: frac,X1: frac] :
      ( ( ( eq @ X1 @ X2 )
       != $true )
      | ( ( eq @ X0 @ X2 )
        = $true )
      | ( ( eq @ X0 @ X1 )
       != $true ) ),
    inference(cnf_transformation,[],[f20]) ).

thf(f24,plain,
    ! [X0: frac,X1: frac] :
      ( ( eq @ ( pf @ X0 @ X1 ) @ ( pf @ X1 @ X0 ) )
      = $true ),
    inference(cnf_transformation,[],[f14]) ).

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

thf(f41,plain,
    ! [X0: frac] :
      ( ( $true != $true )
      | ( $true
        = ( eq @ X0 @ ( pf @ z @ y ) ) )
      | ( $true
       != ( eq @ X0 @ ( pf @ z @ x ) ) ) ),
    inference(constrained_superposition,[],[f23,f21]) ).

thf(f42,plain,
    ! [X2: frac,X0: frac,X1: frac] :
      ( ( $true != $true )
      | ( $true
        = ( eq @ X2 @ ( pf @ X1 @ X0 ) ) )
      | ( $true
       != ( eq @ X2 @ ( pf @ X0 @ X1 ) ) ) ),
    inference(constrained_superposition,[],[f23,f24]) ).

thf(f44,plain,
    ! [X2: frac,X0: frac,X1: frac] :
      ( ( $true
       != ( eq @ X2 @ ( pf @ X0 @ X1 ) ) )
      | ( $true
        = ( eq @ X2 @ ( pf @ X1 @ X0 ) ) ) ),
    inference(trivial_inequality_removal,[],[f42]) ).

thf(f45,plain,
    ! [X0: frac] :
      ( ( $true
       != ( eq @ X0 @ ( pf @ z @ x ) ) )
      | ( $true
        = ( eq @ X0 @ ( pf @ z @ y ) ) ) ),
    inference(trivial_inequality_removal,[],[f41]) ).

thf(f154,plain,
    ( ( $true != $true )
    | ( $true
      = ( eq @ ( pf @ x @ z ) @ ( pf @ z @ y ) ) ) ),
    inference(constrained_superposition,[],[f45,f24]) ).

thf(f161,plain,
    ( $true
    = ( eq @ ( pf @ x @ z ) @ ( pf @ z @ y ) ) ),
    inference(trivial_inequality_removal,[],[f154]) ).

thf(f277,plain,
    ( ( $true != $true )
    | ( $true
      = ( eq @ ( pf @ x @ z ) @ ( pf @ y @ z ) ) ) ),
    inference(constrained_superposition,[],[f44,f161]) ).

thf(f278,plain,
    ( $true
    = ( eq @ ( pf @ x @ z ) @ ( pf @ y @ z ) ) ),
    inference(trivial_inequality_removal,[],[f277]) ).

thf(f566,plain,
    ( ( $true != $true )
    | ( ( eq @ x @ y )
      = $true ) ),
    inference(constrained_superposition,[],[f22,f278]) ).

thf(f579,plain,
    ( ( eq @ x @ y )
    = $true ),
    inference(trivial_inequality_removal,[],[f566]) ).

thf(f585,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f579,f25]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM759^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.08/0.19  % Computer : n002.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Tue Sep 29 12:55:58 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23  Running first-order model finding
% 0.08/0.23  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.22/0.30  % (1230187)Will run a generic schedule for satisfiability detection.
% 0.22/0.30  % (1230192)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4202932351_2999 on theBenchmark for (2999ds/0Mi)
% 0.22/0.30  % Exception at run slice level
% 0.22/0.30  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.22/0.30  % (1230193)% WARNING: option uhcvi not known.
% 0.22/0.30  % (1230193)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3546403542:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.22/0.30  % (1230195)dis+10_1_sil=32000:sp=arity:random_seed=4212309435:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.22/0.30  % (1230194)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=341865753:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.22/0.30  % (1230193)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.22/0.30  % (1230193)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.22/0.30  % (1230200)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2229995064:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.22/0.30  % Exception at run slice level
% 0.22/0.30  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.22/0.30  % (1230197)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4140831338:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.22/0.30  % (1230205)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=51978350:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.22/0.30  % (1230196)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3311665417:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.22/0.30  % (1230198)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=54521468:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.22/0.30  % (1230195) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1230187-1230195"...
% 0.22/0.30  % (1230196)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.22/0.30  % (1230193) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1230187-1230193"...
% 0.22/0.30  % (1230195)...printing done.
% 0.22/0.30  % (1230195)Refutation found. Thanks to Tanya!
% 0.22/0.30  % SZS status Theorem for theBenchmark
% 0.22/0.30  % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.30  % (1230195)------------------------------
% 0.22/0.30  % (1230195)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.30  % (1230195)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.30  % (1230195)CaDiCaL version: 2.1.3
% 0.22/0.30  % (1230195)Termination reason: Refutation
% 0.22/0.30  % (1230195)Time elapsed: 0.021 s
% 0.22/0.30  % (1230195)Peak memory usage: 12 MB
% 0.22/0.30  % (1230195)Instructions burned: 40 (million)
% 0.22/0.30  % (1230187)Success in time 0.06 s
% 0.22/0.30  % Vampire exiting
%------------------------------------------------------------------------------