↑ 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  : NUM756_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n026.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 : Tue Sep 29 12:25:37 PM UTC 2026

% Result   : Theorem 0.14s 0.44s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   46 (  15 unt;   0 typ;   2 def)
%            Number of atoms       :   98 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  105 (  53   ~;  32   |;   4   &)
%                                         (   2 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   49 (   0 sgn  49   !;   0   ?;  49   :)

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

tff(func_def_0,type,
    x: frac ).

tff(func_def_1,type,
    y: frac ).

tff(func_def_2,type,
    z: frac ).

tff(func_def_3,type,
    pf: ( frac * frac ) > frac ).

tff(pred_def_1,type,
    eq: ( frac * frac ) > $o ).

tff(pred_def_2,type,
    lessf: ( frac * frac ) > $o ).

tff(pred_def_3,type,
    moref: ( frac * frac ) > $o ).

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

tff(f3,axiom,
    ! [X0: frac,X1: frac] :
      ~ ( ( eq(X0,X1)
         => ~ moref(X0,X1) )
       => ~ ~ ( ( moref(X0,X1)
               => ~ lessf(X0,X1) )
             => ~ ( lessf(X0,X1)
                 => ~ eq(X0,X1) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz41b) ).

tff(f4,axiom,
    ! [X0: frac,X1: frac,X2: frac] :
      ( lessf(X0,X1)
     => lessf(pf(X0,X2),pf(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz62c) ).

tff(f5,axiom,
    ! [X0: frac,X1: frac] :
      ( ~ eq(X0,X1)
     => ( ~ moref(X0,X1)
       => lessf(X0,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz41a) ).

tff(f6,axiom,
    ! [X0: frac,X1: frac,X2: frac] :
      ( moref(X0,X1)
     => moref(pf(X0,X2),pf(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz62a) ).

tff(f7,conjecture,
    eq(x,y),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz63b) ).

tff(f8,negated_conjecture,
    ~ eq(x,y),
    inference(negated_conjecture,[status(cth)],[f7]) ).

tff(f11,plain,
    ! [X0: frac,X1: frac] :
      ~ ( ( eq(X0,X1)
         => ~ moref(X0,X1) )
       => ( ( moref(X0,X1)
           => ~ lessf(X0,X1) )
         => ~ ( lessf(X0,X1)
             => ~ eq(X0,X1) ) ) ),
    inference(flattening,[],[f3]) ).

tff(f12,plain,
    ~ eq(x,y),
    inference(flattening,[],[f8]) ).

tff(f14,plain,
    ! [X0: frac,X1: frac] :
      ( ( ~ eq(X0,X1)
        | ~ lessf(X0,X1) )
      & ( ~ lessf(X0,X1)
        | ~ moref(X0,X1) )
      & ( ~ moref(X0,X1)
        | ~ eq(X0,X1) ) ),
    inference(ennf_transformation,[],[f11]) ).

tff(f15,plain,
    ! [X0: frac,X1: frac] :
      ( ( ~ eq(X0,X1)
        | ~ lessf(X0,X1) )
      & ( ~ lessf(X0,X1)
        | ~ moref(X0,X1) )
      & ( ~ moref(X0,X1)
        | ~ eq(X0,X1) ) ),
    inference(flattening,[],[f14]) ).

tff(f16,plain,
    ! [X0: frac,X1: frac,X2: frac] :
      ( lessf(pf(X0,X2),pf(X1,X2))
      | ~ lessf(X0,X1) ),
    inference(ennf_transformation,[],[f4]) ).

tff(f17,plain,
    ! [X0: frac,X1: frac] :
      ( lessf(X0,X1)
      | moref(X0,X1)
      | eq(X0,X1) ),
    inference(ennf_transformation,[],[f5]) ).

tff(f18,plain,
    ! [X0: frac,X1: frac] :
      ( lessf(X0,X1)
      | moref(X0,X1)
      | eq(X0,X1) ),
    inference(flattening,[],[f17]) ).

tff(f19,plain,
    ! [X0: frac,X1: frac,X2: frac] :
      ( moref(pf(X0,X2),pf(X1,X2))
      | ~ moref(X0,X1) ),
    inference(ennf_transformation,[],[f6]) ).

tff(f20,plain,
    eq(pf(x,z),pf(y,z)),
    inference(cnf_transformation,[],[f1]) ).

tff(f21,plain,
    ! [X0: frac,X1: frac] :
      ( ~ lessf(X0,X1)
      | ~ eq(X0,X1) ),
    inference(cnf_transformation,[],[f15]) ).

tff(f23,plain,
    ! [X0: frac,X1: frac] :
      ( ~ eq(X0,X1)
      | ~ moref(X0,X1) ),
    inference(cnf_transformation,[],[f15]) ).

tff(f24,plain,
    ! [X2: frac,X0: frac,X1: frac] :
      ( lessf(pf(X0,X2),pf(X1,X2))
      | ~ lessf(X0,X1) ),
    inference(cnf_transformation,[],[f16]) ).

tff(f25,plain,
    ! [X0: frac,X1: frac] :
      ( eq(X0,X1)
      | moref(X0,X1)
      | lessf(X0,X1) ),
    inference(cnf_transformation,[],[f18]) ).

tff(f26,plain,
    ! [X2: frac,X0: frac,X1: frac] :
      ( ~ moref(X0,X1)
      | moref(pf(X0,X2),pf(X1,X2)) ),
    inference(cnf_transformation,[],[f19]) ).

tff(f27,plain,
    ~ eq(x,y),
    inference(cnf_transformation,[],[f12]) ).

tff(f28,plain,
    ~ eq(pf(x,z),pf(y,z)),
    inference(consistent_polarity_flipping,[],[f20]) ).

tff(f29,plain,
    ! [X0: frac,X1: frac] :
      ( ~ moref(X0,X1)
      | eq(X0,X1) ),
    inference(consistent_polarity_flipping,[],[f23]) ).

tff(f30,plain,
    ! [X0: frac,X1: frac] :
      ( ~ lessf(X0,X1)
      | eq(X0,X1) ),
    inference(consistent_polarity_flipping,[],[f21]) ).

tff(f31,plain,
    ! [X0: frac,X1: frac] :
      ( ~ eq(X0,X1)
      | moref(X0,X1)
      | lessf(X0,X1) ),
    inference(consistent_polarity_flipping,[],[f25]) ).

tff(f32,plain,
    eq(x,y),
    inference(consistent_polarity_flipping,[],[f27]) ).

tff(f33,plain,
    ( moref(x,y)
    | lessf(x,y) ),
    inference(resolution,[],[f31,f32]) ).

tff(f35,definition,
    ( spl0_1
  <=> lessf(x,y) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

tff(f37,plain,
    ( lessf(x,y)
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f35]) ).

tff(f39,definition,
    ( spl0_2
  <=> moref(x,y) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

tff(f41,plain,
    ( moref(x,y)
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f39]) ).

tff(f42,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f33,f39,f35]) ).

tff(f46,plain,
    ! [X2: frac,X0: frac,X1: frac] :
      ( eq(pf(X0,X2),pf(X1,X2))
      | ~ lessf(X0,X1) ),
    inference(resolution,[],[f24,f30]) ).

tff(f47,plain,
    ( ! [X0: frac] : moref(pf(x,X0),pf(y,X0))
    | ~ spl0_2 ),
    inference(resolution,[],[f26,f41]) ).

tff(f49,plain,
    ( ! [X0: frac] : eq(pf(x,X0),pf(y,X0))
    | ~ spl0_2 ),
    inference(resolution,[],[f47,f29]) ).

tff(f51,plain,
    ( $false
    | ~ spl0_2 ),
    inference(backward_subsumption_resolution,[],[f28,f49]) ).

tff(f53,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f51]) ).

tff(f55,plain,
    ~ lessf(x,y),
    inference(resolution,[],[f46,f28]) ).

tff(f57,plain,
    ( $false
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f55,f37]) ).

tff(f58,plain,
    ~ spl0_1,
    inference(avatar_contradiction_clause,[],[f57]) ).

cnf(s1,plain,
    ( spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f42]) ).

cnf(s3,plain,
    ~ spl0_2,
    inference(sat_conversion,[],[f53]) ).

cnf(s4,plain,
    ~ spl0_1,
    inference(sat_conversion,[],[f58]) ).

cnf(s5,plain,
    $false,
    inference(rat,[],[s1,s3,s4]) ).

tff(f59,plain,
    $false,
    inference(avatar_sat_refutation,[],[s5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM756_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.36  % Computer : n026.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Sun Sep 27 21:21:12 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.11/0.36  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.14/0.39  Running first-order model finding
% 0.14/0.39  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.14/0.44  % (3211776)Will run a generic schedule for satisfiability detection.
% 0.14/0.44  % (3211782)% WARNING: option uhcvi not known.
% 0.14/0.44  % (3211781)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1428272841_2999 on theBenchmark for (2999ds/0Mi)
% 0.14/0.44  % (3211782)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3659831528:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.14/0.44  % (3211783)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=138892584:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.14/0.44  % (3211784)dis+10_1_sil=32000:sp=arity:random_seed=1712531164:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.14/0.44  % (3211785)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2934095886:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.14/0.44  % (3211786)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=320560093:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.14/0.44  % (3211787)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2532150512:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.14/0.44  % Detected minimum model sizes of [1,1]
% 0.14/0.44  % Detected maximum model sizes of [max,2]
% 0.14/0.44  % TRYING [1,1]
% 0.14/0.44  % TRYING [1,2]
% 0.14/0.44  % (3211785) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3211776-3211785"...
% 0.14/0.44  % TRYING [2,2]
% 0.14/0.44  % (3211782) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3211776-3211782"...
% 0.14/0.44  % TRYING [3,2]
% 0.14/0.44  % (3211784) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3211776-3211784"...
% 0.14/0.44  % TRYING [4,2]
% 0.14/0.44  % (3211785)...printing done.
% 0.14/0.44  % (3211782)...printing done.
% 0.14/0.44  % TRYING [5,2]
% 0.14/0.44  % (3211784)...printing done.
% 0.14/0.44  % (3211783) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3211776-3211783"...
% 0.14/0.44  % (3211783)...printing done.
% 0.14/0.44  % (3211782)Refutation found. Thanks to Tanya!
% 0.14/0.44  % SZS status Theorem for theBenchmark
% 0.14/0.44  % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.44  % (3211782)------------------------------
% 0.14/0.44  % (3211782)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.14/0.44  % (3211782)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/0.44  % (3211782)CaDiCaL version: 2.1.3
% 0.14/0.44  % (3211782)Termination reason: Refutation
% 0.14/0.44  % (3211782)Time elapsed: 0.002 s
% 0.14/0.44  % (3211782)Peak memory usage: 12 MB
% 0.14/0.44  % (3211782)Instructions burned: 2 (million)
% 0.14/0.44  % (3211776)Success in time 0.036 s
% 0.14/0.44  % Vampire exiting
%------------------------------------------------------------------------------