↑ 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  : QUA004^1 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n014.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:21:25 AM UTC 2026

% Result   : Theorem 0.35s 0.26s
% Output   : Refutation 0.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   26 (  26 unt;   0 typ;   0 def)
%            Number of atoms       :   75 (  38 equ;   2 cnn)
%            Maximal formula atoms :    1 (   2 avg)
%            Number of connectives :   77 (   9   ~;   7   |;   0   &;  61   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   12 (  12   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   26 (  23 usr;   3 con; 0-4 aty)
%            Number of variables   :   53 (  46   ^;   6   !;   1   ?;  53   :)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    sTfun: ( $tType * $tType ) > $tType ).

thf(func_def_0,type,
    emptyset: $i > $o ).

thf(func_def_1,type,
    union: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(func_def_3,type,
    singleton: $i > $i > $o ).

thf(func_def_5,type,
    sup: ( $i > $o ) > $i ).

thf(func_def_6,type,
    supset: ( ( $i > $o ) > $o ) > $i > $o ).

thf(func_def_7,type,
    unionset: ( ( $i > $o ) > $o ) > $i > $o ).

thf(func_def_8,type,
    addition: $i > $i > $i ).

thf(func_def_9,type,
    leq: $i > $i > $o ).

thf(func_def_10,type,
    multiplication: $i > $i > $i ).

thf(func_def_11,type,
    crossmult: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(func_def_15,type,
    vLAM: 
      !>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).

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

thf(func_def_17,type,
    db2: 
      !>[X0: $tType] : X0 ).

thf(func_def_18,type,
    db0: 
      !>[X0: $tType] : X0 ).

thf(func_def_19,type,
    db1: 
      !>[X0: $tType] : X0 ).

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

thf(func_def_21,type,
    vSIGMA: 
      !>[X0: $tType] : ( ( X0 > $o ) > $o ) ).

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

thf(func_def_23,type,
    db4: 
      !>[X0: $tType] : X0 ).

thf(func_def_24,type,
    db3: 
      !>[X0: $tType] : X0 ).

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

thf(f2,axiom,
    ( union
    = ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
          ( ( X1 @ X2 )
          | ( X0 @ X2 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/QUA001^0.ax',union_def) ).

thf(f3,axiom,
    ( singleton
    = ( ^ [X0: $i,X1: $i] : ( X1 = X0 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/QUA001^0.ax',singleton_def) ).

thf(f5,axiom,
    ! [X0: $i] :
      ( ( sup @ ( singleton @ X0 ) )
      = X0 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/QUA001^0.ax',sup_singleset) ).

thf(f9,axiom,
    ( addition
    = ( ^ [X0: $i,X1: $i] : ( sup @ ( union @ ( singleton @ X0 ) @ ( singleton @ X1 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/QUA001^0.ax',addition_def) ).

thf(f15,conjecture,
    ! [X0: $i] :
      ( ( addition @ X0 @ X0 )
      = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addition_idemp) ).

thf(f16,negated_conjecture,
    ~ ! [X0: $i] :
        ( ( addition @ X0 @ X0 )
        = X0 ),
    inference(negated_conjecture,[status(cth)],[f15]) ).

thf(f18,plain,
    ( union
    = ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
          ( ( X1 @ X2 )
          | ( X0 @ X2 ) ) ) ),
    inference(rectify,[],[f2]) ).

thf(f19,plain,
    ( union
    = ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
          ( ( Y0 @ Y2 )
          | ( Y1 @ Y2 ) ) ) ),
    inference(fool_elimination,[],[f18]) ).

thf(f20,plain,
    ( singleton
    = ( ^ [Y0: $i,Y1: $i] : ( Y0 = Y1 ) ) ),
    inference(fool_elimination,[],[f3]) ).

thf(f25,plain,
    ( addition
    = ( ^ [Y0: $i,Y1: $i] : ( sup @ ( union @ ( singleton @ Y0 ) @ ( singleton @ Y1 ) ) ) ) ),
    inference(fool_elimination,[],[f9]) ).

thf(f30,plain,
    ? [X0: $i] :
      ( ( addition @ X0 @ X0 )
     != X0 ),
    inference(ennf_transformation,[],[f16]) ).

thf(f32,plain,
    ( sK0
   != ( addition @ sK0 @ sK0 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f30]) ).

thf(f34,plain,
    ( union
    = ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
          ( ( Y0 @ Y2 )
          | ( Y1 @ Y2 ) ) ) ),
    inference(cnf_transformation,[],[f19]) ).

thf(f35,plain,
    ( singleton
    = ( ^ [Y0: $i,Y1: $i] : ( Y0 = Y1 ) ) ),
    inference(cnf_transformation,[],[f20]) ).

thf(f37,plain,
    ! [X0: $i] :
      ( ( sup @ ( singleton @ X0 ) )
      = X0 ),
    inference(cnf_transformation,[],[f5]) ).

thf(f41,plain,
    ( addition
    = ( ^ [Y0: $i,Y1: $i] : ( sup @ ( union @ ( singleton @ Y0 ) @ ( singleton @ Y1 ) ) ) ) ),
    inference(cnf_transformation,[],[f25]) ).

thf(f48,plain,
    ( sK0
   != ( addition @ sK0 @ sK0 ) ),
    inference(cnf_transformation,[],[f32]) ).

thf(f51,plain,
    ( addition
    = ( ^ [Y0: $i,Y1: $i] :
          ( sup
          @ ( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
                ( ( Y2 @ Y4 )
                | ( Y3 @ Y4 ) )
            @ ( ^ [Y2: $i,Y3: $i] : ( Y2 = Y3 )
              @ Y0 )
            @ ( ^ [Y2: $i,Y3: $i] : ( Y2 = Y3 )
              @ Y1 ) ) ) ) ),
    inference(definition_unfolding,[],[f41,f34,f35,f35]) ).

thf(f53,plain,
    ! [X0: $i] :
      ( ( sup
        @ ( ^ [Y0: $i,Y1: $i] : ( Y0 = Y1 )
          @ X0 ) )
      = X0 ),
    inference(definition_unfolding,[],[f37,f35]) ).

thf(f58,plain,
    ( sK0
   != ( ^ [Y0: $i,Y1: $i] :
          ( sup
          @ ( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
                ( ( Y2 @ Y4 )
                | ( Y3 @ Y4 ) )
            @ ( ^ [Y2: $i,Y3: $i] : ( Y2 = Y3 )
              @ Y0 )
            @ ( ^ [Y2: $i,Y3: $i] : ( Y2 = Y3 )
              @ Y1 ) ) )
      @ sK0
      @ sK0 ) ),
    inference(definition_unfolding,[],[f48,f51]) ).

thf(f59,plain,
    ( sK0
   != ( sup
      @ ^ [Y0: $i] :
          ( ( sK0 = Y0 )
          | ( sK0 = Y0 ) ) ) ),
    inference(beta-eta_normalization,[],[f58]) ).

thf(f60,plain,
    ( sK0
   != ( sup
      @ ^ [Y0: $i] : ( sK0 = Y0 ) ) ),
    inference(boolean_simplification,[],[f59]) ).

thf(f61,plain,
    ( sK0
   != ( sup @ ( (=) @ sK0 ) ) ),
    inference(beta-eta_normalization,[],[f60]) ).

thf(f66,plain,
    ! [X0: $i] :
      ( ( sup @ ( (=) @ X0 ) )
      = X0 ),
    inference(beta-eta_normalization,[],[f53]) ).

thf(f74,plain,
    sK0 != sK0,
    inference(constrained_superposition,[],[f61,f66]) ).

thf(f75,plain,
    $false,
    inference(trivial_inequality_removal,[],[f74]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : QUA004^1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18  % Computer : n014.cluster.edu
% 0.07/0.18  % Model    : x86_64 x86_64
% 0.07/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18  % Memory   : 8046.5625MB
% 0.07/0.18  % OS       : Linux 6.8.0-71-generic
% 0.07/0.18  % CPULimit : 300
% 0.07/0.18  % WCLimit  : 300
% 0.07/0.18  % DateTime : Tue Sep 29 13:28:53 UTC 2026
% 0.07/0.18  % CPUTime  : 
% 0.07/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21  Running first-order model finding
% 0.07/0.21  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.35/0.26  % (2645305)Will run a generic schedule for satisfiability detection.
% 0.35/0.26  % (2645310)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1406943137_2999 on theBenchmark for (2999ds/0Mi)
% 0.35/0.26  % Exception at run slice level
% 0.35/0.26  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.35/0.26  % (2645311)% WARNING: option uhcvi not known.
% 0.35/0.26  % (2645311)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1214693986:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.35/0.26  % (2645312)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1369086586:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.35/0.26  % (2645315)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1883731231:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.35/0.26  % (2645313)dis+10_1_sil=32000:sp=arity:random_seed=3765657314:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.35/0.26  % (2645314)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1133301384:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.35/0.26  % (2645316)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3776095287:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.35/0.26  % (2645311)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.35/0.26  % (2645314)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.35/0.26  % (2645311)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.35/0.26  % (2645313) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2645305-2645313"...
% 0.35/0.26  % (2645318)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2270285157:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.35/0.26  % (2645315) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2645305-2645315"...
% 0.35/0.26  % (2645311) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2645305-2645311"...
% 0.35/0.26  % (2645314) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2645305-2645314"...
% 0.35/0.26  % (2645316) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2645305-2645316"...
% 0.35/0.26  % (2645312) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2645305-2645312"...
% 0.35/0.26  % Exception at run slice level
% 0.35/0.26  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.35/0.26  % (2645313)...printing done.
% 0.35/0.26  % (2645315)...printing done.
% 0.35/0.26  % (2645311)...printing done.
% 0.35/0.26  % (2645314)...printing done.
% 0.35/0.26  % (2645316)...printing done.
% 0.35/0.26  % (2645312)...printing done.
% 0.35/0.26  % (2645313)Refutation found. Thanks to Tanya!
% 0.35/0.26  % SZS status Theorem for theBenchmark
% 0.35/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.35/0.26  % (2645313)------------------------------
% 0.35/0.26  % (2645313)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.35/0.26  % (2645313)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.35/0.26  % (2645313)CaDiCaL version: 2.1.3
% 0.35/0.26  % (2645313)Termination reason: Refutation
% 0.35/0.26  % (2645313)Time elapsed: 0.004 s
% 0.35/0.26  % (2645313)Peak memory usage: 12 MB
% 0.35/0.26  % (2645313)Instructions burned: 5 (million)
% 0.35/0.26  % (2645305)Success in time 0.038 s
% 0.35/0.26  % Vampire exiting
%------------------------------------------------------------------------------