↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWC261-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n005.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 01:03:11 PM UTC 2026

% Result   : Unsatisfiable 0.19s 1.30s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   22
% Syntax   : Number of formulae    :   79 (  19 unt;   5 def)
%            Number of atoms       :  205 (  13 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  250 ( 124   ~; 121   |;   0   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :   12 (  10 usr;   6 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   3 con; 0-2 aty)
%            Number of variables   :   29 (   0 sgn  29   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f27,axiom,
    ! [X0] : ssList(skaf68(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause27) ).

fof(f28,axiom,
    ! [X0] : ssList(skaf67(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause28) ).

fof(f29,axiom,
    ! [X0] : ssList(skaf66(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause29) ).

fof(f30,axiom,
    ! [X0] : ssItem(skaf65(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause30) ).

fof(f31,axiom,
    ! [X0] : ssItem(skaf64(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause31) ).

fof(f62,axiom,
    ! [X0] :
      ( leq(X0,X0)
      | ~ ssItem(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause62) ).

fof(f85,axiom,
    ! [X0,X1] :
      ( ssList(app(X1,X0))
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause85) ).

fof(f86,axiom,
    ! [X0,X1] :
      ( ssList(cons(X0,X1))
      | ~ ssList(X1)
      | ~ ssItem(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause86) ).

fof(f91,axiom,
    ! [X0] :
      ( ~ leq(skaf64(X0),skaf65(X0))
      | ~ ssList(X0)
      | totalorderedP(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause91) ).

fof(f151,axiom,
    ! [X2,X0,X1] :
      ( memberP(app(X0,X2),X1)
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssItem(X1)
      | ~ memberP(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause140) ).

fof(f177,axiom,
    ! [X0] :
      ( totalorderedP(X0)
      | ~ ssList(X0)
      | app(app(skaf66(X0),cons(skaf64(X0),skaf67(X0))),cons(skaf65(X0),skaf68(X0))) = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause164) ).

fof(f189,axiom,
    ! [X2,X3,X0,X1] :
      ( app(X0,cons(X1,X2)) != X3
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssItem(X1)
      | ~ ssList(X3)
      | memberP(X3,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause175) ).

fof(f200,negated_conjecture,
    ssList(sk1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).

fof(f205,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).

fof(f206,negated_conjecture,
    ssItem(sk5),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

fof(f207,negated_conjecture,
    ! [X0] :
      ( ~ ssItem(X0)
      | sk5 = X0
      | ~ memberP(sk3,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

fof(f208,negated_conjecture,
    ~ totalorderedP(sk1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).

fof(f224,plain,
    ! [X2,X0,X1] :
      ( ~ ssList(app(X0,cons(X1,X2)))
      | ~ ssList(X0)
      | ~ ssItem(X1)
      | ~ ssList(X2)
      | memberP(app(X0,cons(X1,X2)),X1) ),
    inference(equality_resolution,[],[f189]) ).

fof(f283,plain,
    ! [X0] :
      ( ~ memberP(sk1,X0)
      | ~ ssItem(X0)
      | sk5 = X0 ),
    inference(forward_demodulation,[],[f207,f205]) ).

fof(f308,plain,
    ( ~ ssList(sk1)
    | sk1 = app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))) ),
    inference(resolution,[],[f177,f208]) ).

fof(f310,plain,
    sk1 = app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))),
    inference(forward_subsumption_resolution,[],[f308,f200]) ).

fof(f311,plain,
    ( ~ ssList(sk1)
    | ~ ssList(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))))
    | ~ ssItem(skaf65(sk1))
    | ~ ssList(skaf68(sk1))
    | memberP(sk1,skaf65(sk1)) ),
    inference(superposition,[],[f224,f310]) ).

fof(f314,plain,
    ! [X0] :
      ( memberP(sk1,X0)
      | ~ ssList(cons(skaf65(sk1),skaf68(sk1)))
      | ~ ssList(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))))
      | ~ ssItem(X0)
      | ~ memberP(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),X0) ),
    inference(superposition,[],[f151,f310]) ).

fof(f316,definition,
    ( spl0_10
  <=> ssList(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1)))) ),
    introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).

fof(f317,plain,
    ( ssList(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))))
    | ~ spl0_10 ),
    inference(avatar_component_clause,[],[f316]) ).

fof(f318,plain,
    ( ~ ssList(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))))
    | spl0_10 ),
    inference(avatar_component_clause,[],[f316]) ).

fof(f320,definition,
    ( spl0_11
  <=> ssList(cons(skaf65(sk1),skaf68(sk1))) ),
    introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).

fof(f322,plain,
    ( ~ ssList(cons(skaf65(sk1),skaf68(sk1)))
    | spl0_11 ),
    inference(avatar_component_clause,[],[f320]) ).

fof(f324,definition,
    ( spl0_12
  <=> ! [X0] :
        ( memberP(sk1,X0)
        | ~ memberP(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),X0)
        | ~ ssItem(X0) ) ),
    introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition]) ).

fof(f325,plain,
    ( ! [X0] :
        ( memberP(sk1,X0)
        | ~ memberP(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),X0)
        | ~ ssItem(X0) )
    | ~ spl0_12 ),
    inference(avatar_component_clause,[],[f324]) ).

fof(f326,plain,
    ( ~ spl0_10
    | ~ spl0_11
    | spl0_12 ),
    inference(avatar_split_clause,[],[f314,f324,f320,f316]) ).

fof(f344,plain,
    ( ~ ssList(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))))
    | ~ ssItem(skaf65(sk1))
    | ~ ssList(skaf68(sk1))
    | memberP(sk1,skaf65(sk1)) ),
    inference(forward_subsumption_resolution,[],[f311,f200]) ).

fof(f345,plain,
    ( ~ ssList(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))))
    | ~ ssItem(skaf65(sk1))
    | memberP(sk1,skaf65(sk1)) ),
    inference(forward_subsumption_resolution,[],[f344,f27]) ).

fof(f347,definition,
    ( spl0_17
  <=> memberP(sk1,skaf65(sk1)) ),
    introduced(definition,[new_symbols(definition,[spl0_17])],[avatar_definition]) ).

fof(f349,plain,
    ( memberP(sk1,skaf65(sk1))
    | ~ spl0_17 ),
    inference(avatar_component_clause,[],[f347]) ).

fof(f351,definition,
    ( spl0_18
  <=> ssItem(skaf65(sk1)) ),
    introduced(definition,[new_symbols(definition,[spl0_18])],[avatar_definition]) ).

fof(f353,plain,
    ( ~ ssItem(skaf65(sk1))
    | spl0_18 ),
    inference(avatar_component_clause,[],[f351]) ).

fof(f354,plain,
    ( spl0_17
    | ~ spl0_18
    | ~ spl0_10 ),
    inference(avatar_split_clause,[],[f345,f316,f351,f347]) ).

fof(f408,plain,
    ( ~ ssList(skaf66(sk1))
    | ~ ssList(cons(skaf64(sk1),skaf67(sk1)))
    | spl0_10 ),
    inference(resolution,[],[f85,f318]) ).

fof(f418,plain,
    ( ~ ssList(cons(skaf64(sk1),skaf67(sk1)))
    | spl0_10 ),
    inference(forward_subsumption_resolution,[],[f408,f29]) ).

fof(f421,plain,
    ( ~ ssList(skaf67(sk1))
    | ~ ssItem(skaf64(sk1))
    | spl0_10 ),
    inference(resolution,[],[f86,f418]) ).

fof(f422,plain,
    ( ~ ssItem(skaf64(sk1))
    | spl0_10 ),
    inference(forward_subsumption_resolution,[],[f421,f28]) ).

fof(f425,plain,
    ( $false
    | spl0_10 ),
    inference(forward_subsumption_resolution,[],[f422,f31]) ).

fof(f426,plain,
    spl0_10,
    inference(avatar_contradiction_clause,[],[f425]) ).

fof(f431,plain,
    ( $false
    | spl0_18 ),
    inference(forward_subsumption_resolution,[],[f353,f30]) ).

fof(f432,plain,
    spl0_18,
    inference(avatar_contradiction_clause,[],[f431]) ).

fof(f433,plain,
    ( ~ ssItem(skaf65(sk1))
    | sk5 = skaf65(sk1)
    | ~ spl0_17 ),
    inference(resolution,[],[f349,f283]) ).

fof(f434,plain,
    ( sk5 = skaf65(sk1)
    | ~ spl0_17 ),
    inference(forward_subsumption_resolution,[],[f433,f30]) ).

fof(f438,plain,
    ( ~ leq(skaf64(sk1),sk5)
    | ~ ssList(sk1)
    | totalorderedP(sk1)
    | ~ spl0_17 ),
    inference(superposition,[],[f91,f434]) ).

fof(f439,plain,
    ( ~ leq(skaf64(sk1),sk5)
    | totalorderedP(sk1)
    | ~ spl0_17 ),
    inference(forward_subsumption_resolution,[],[f438,f200]) ).

fof(f441,plain,
    ( ~ leq(skaf64(sk1),sk5)
    | ~ spl0_17 ),
    inference(forward_subsumption_resolution,[],[f439,f208]) ).

fof(f446,plain,
    ( ~ ssList(cons(sk5,skaf68(sk1)))
    | spl0_11
    | ~ spl0_17 ),
    inference(forward_demodulation,[],[f322,f434]) ).

fof(f447,plain,
    ( ~ ssList(skaf68(sk1))
    | ~ ssItem(sk5)
    | spl0_11
    | ~ spl0_17 ),
    inference(resolution,[],[f446,f86]) ).

fof(f448,plain,
    ( ~ ssItem(sk5)
    | spl0_11
    | ~ spl0_17 ),
    inference(forward_subsumption_resolution,[],[f447,f27]) ).

fof(f449,plain,
    ( $false
    | spl0_11
    | ~ spl0_17 ),
    inference(forward_subsumption_resolution,[],[f448,f206]) ).

fof(f450,plain,
    ( spl0_11
    | ~ spl0_17 ),
    inference(avatar_contradiction_clause,[],[f449]) ).

fof(f454,plain,
    ( ~ ssList(skaf66(sk1))
    | ~ ssItem(skaf64(sk1))
    | ~ ssList(skaf67(sk1))
    | memberP(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),skaf64(sk1))
    | ~ spl0_10 ),
    inference(resolution,[],[f317,f224]) ).

fof(f455,plain,
    ( ~ ssItem(skaf64(sk1))
    | ~ ssList(skaf67(sk1))
    | memberP(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),skaf64(sk1))
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[],[f454,f29]) ).

fof(f456,plain,
    ( ~ ssList(skaf67(sk1))
    | memberP(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),skaf64(sk1))
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[],[f455,f31]) ).

fof(f457,plain,
    ( memberP(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),skaf64(sk1))
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[],[f456,f28]) ).

fof(f575,plain,
    ( ! [X0] :
        ( ~ memberP(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),X0)
        | ~ ssItem(X0)
        | ~ ssItem(X0)
        | sk5 = X0 )
    | ~ spl0_12 ),
    inference(resolution,[],[f325,f283]) ).

fof(f576,plain,
    ( ! [X0] :
        ( ~ memberP(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),X0)
        | ~ ssItem(X0)
        | sk5 = X0 )
    | ~ spl0_12 ),
    inference(duplicate_literal_removal,[],[f575]) ).

fof(f599,plain,
    ( ~ ssItem(skaf64(sk1))
    | sk5 = skaf64(sk1)
    | ~ spl0_10
    | ~ spl0_12 ),
    inference(resolution,[],[f576,f457]) ).

fof(f602,plain,
    ( sk5 = skaf64(sk1)
    | ~ spl0_10
    | ~ spl0_12 ),
    inference(forward_subsumption_resolution,[],[f599,f31]) ).

fof(f610,plain,
    ( ~ leq(sk5,sk5)
    | ~ spl0_10
    | ~ spl0_12
    | ~ spl0_17 ),
    inference(superposition,[],[f441,f602]) ).

fof(f621,plain,
    ( ~ ssItem(sk5)
    | ~ spl0_10
    | ~ spl0_12
    | ~ spl0_17 ),
    inference(resolution,[],[f610,f62]) ).

fof(f623,plain,
    ( $false
    | ~ spl0_10
    | ~ spl0_12
    | ~ spl0_17 ),
    inference(forward_subsumption_resolution,[],[f621,f206]) ).

fof(f624,plain,
    ( ~ spl0_10
    | ~ spl0_12
    | ~ spl0_17 ),
    inference(avatar_contradiction_clause,[],[f623]) ).

cnf(s11,plain,
    ( ~ spl0_10
    | ~ spl0_11
    | spl0_12 ),
    inference(sat_conversion,[],[f326]) ).

cnf(s14,plain,
    ( ~ spl0_10
    | spl0_17
    | ~ spl0_18 ),
    inference(sat_conversion,[],[f354]) ).

cnf(s15,plain,
    spl0_10,
    inference(sat_conversion,[],[f426]) ).

cnf(s16,plain,
    spl0_18,
    inference(sat_conversion,[],[f432]) ).

cnf(s18,plain,
    ( spl0_11
    | ~ spl0_17 ),
    inference(sat_conversion,[],[f450]) ).

cnf(s22,plain,
    ( ~ spl0_10
    | ~ spl0_12
    | ~ spl0_17 ),
    inference(sat_conversion,[],[f624]) ).

cnf(s24,plain,
    spl0_17,
    inference(rat,[],[s14,s16,s15]) ).

cnf(s25,plain,
    spl0_11,
    inference(rat,[],[s18,s24]) ).

cnf(s27,plain,
    ~ spl0_12,
    inference(rat,[],[s22,s15,s24]) ).

cnf(s30,plain,
    $false,
    inference(rat,[],[s11,s27,s25,s15]) ).

fof(f626,plain,
    $false,
    inference(avatar_sat_refutation,[],[s30]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC261-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18  % Computer : n005.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Mon Sep 28 08:45:17 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22  Running first-order theorem proving
% 0.08/0.22  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.99/1.10  % (648410)Input is clausal, will run a generic CNF schedule.
% 2.99/1.10  % (648418)lrs+10_1_sil=8000:sp=occurrence:random_seed=1906293019:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.99/1.10  % (648418)Instruction limit reached! 
% 2.99/1.10  % (648418)------------------------------
% 2.99/1.10  % (648418)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.99/1.10  % (648418)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.99/1.10  % (648418)CaDiCaL version: 2.1.3
% 2.99/1.10  % (648418)Termination reason: Instruction limit
% 2.99/1.10  % (648418)Termination phase: Saturation
% 2.99/1.10  % (648418)Time elapsed: 0.037 s
% 2.99/1.10  % (648418)Peak memory usage: 90 MB
% 2.99/1.10  % (648418)Instructions burned: 108 (million)
% 2.99/1.10  % (648415)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3874933893:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.99/1.10  % (648421)dis-21_1_sil=8000:lcm=predicate:random_seed=171314129:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 2.99/1.10  % (648417)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1992298841:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.99/1.10  % (648416)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2296056181:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.99/1.10  % (648419)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3581611059:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.99/1.10  % (648420)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=15182071:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.99/1.10  % (648420)First to succeed.
% 2.99/1.10  % (648420)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-648410"
% 2.99/1.10  % (648421)Instruction limit reached! 
% 2.99/1.10  % (648421)------------------------------
% 2.99/1.10  % (648421)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.99/1.10  % (648421)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.99/1.10  % (648421)CaDiCaL version: 2.1.3
% 2.99/1.10  % (648421)Termination reason: Instruction limit
% 2.99/1.10  % (648421)Termination phase: Saturation
% 2.99/1.10  % (648421)Time elapsed: 0.052 s
% 2.99/1.10  % (648421)Peak memory usage: 89 MB
% 2.99/1.10  % (648421)Instructions burned: 119 (million)
% 2.99/1.10  % (648419)Instruction limit reached! 
% 2.99/1.10  % (648419)------------------------------
% 2.99/1.10  % (648419)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.99/1.10  % (648419)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.99/1.10  % (648419)CaDiCaL version: 2.1.3
% 2.99/1.10  % (648419)Termination reason: Instruction limit
% 2.99/1.10  % (648419)Termination phase: Saturation
% 2.99/1.10  % (648419)Time elapsed: 0.064 s
% 2.99/1.10  % (648419)Peak memory usage: 89 MB
% 2.99/1.10  % (648419)Instructions burned: 115 (million)
% 2.99/1.10  % (648423)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=2536933671:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 2.99/1.10  % (648423)Refutation not found, incomplete strategy
% 2.99/1.10  % (648423)------------------------------
% 2.99/1.10  % (648423)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.99/1.10  % (648423)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.99/1.10  % (648423)CaDiCaL version: 2.1.3
% 2.99/1.10  % (648423)Termination reason: Refutation not found, incomplete strategy
% 2.99/1.10  % (648423)Time elapsed: 0.002 s
% 2.99/1.10  % (648423)Peak memory usage: 88 MB
% 2.99/1.10  % (648423)Instructions burned: 3 (million)
% 2.99/1.10  % (648430)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=3023595393:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2997 on theBenchmark for (2997ds/189Mi)
% 2.99/1.10  % (648431)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=4039981848:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 2.99/1.10  % (648431)Refutation not found, incomplete strategy
% 2.99/1.10  % (648431)------------------------------
% 2.99/1.10  % (648431)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.19/1.30  % (648431)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/1.30  % (648431)CaDiCaL version: 2.1.3
% 0.19/1.30  % (648431)Termination reason: Refutation not found, incomplete strategy
% 0.19/1.30  % (648431)Time elapsed: 0.004 s
% 0.19/1.30  % (648431)Peak memory usage: 88 MB
% 0.19/1.30  % (648431)Instructions burned: 5 (million)
% 0.19/1.30  % (648423)------------------------------
% 0.19/1.30  % (648423)------------------------------
% 0.19/1.30  % (648420)Refutation found. Thanks to Tanya!
% 0.19/1.30  % SZS status Unsatisfiable for theBenchmark
% 0.19/1.30  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/1.30  % (648420)------------------------------
% 0.19/1.30  % (648420)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.19/1.30  % (648420)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/1.30  % (648420)CaDiCaL version: 2.1.3
% 0.19/1.30  % (648420)Termination reason: Refutation
% 0.19/1.30  % (648420)Time elapsed: 0.016 s
% 0.19/1.30  % (648420)Peak memory usage: 90 MB
% 0.19/1.30  % (648420)Instructions burned: 21 (million)
% 0.19/1.30  % (648420)------------------------------
% 0.19/1.30  % (648420)------------------------------
% 0.19/1.30  % (648410)Success in time 0.435 s
% 0.19/1.30  % Vampire exiting
%------------------------------------------------------------------------------