↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n018.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:39:35 PM UTC 2026

% Result   : Unsatisfiable 5.51s 1.78s
% Output   : Refutation 7.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   94 (  17 unt;   4 def)
%            Number of atoms       :  232 (  70 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  261 ( 123   ~; 134   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   5 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   32 (   0 sgn  32   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X2,X0,X1] :
      ( ~ member(X0,non_ordered_pair(X1,X2))
      | X0 = X1
      | X0 = X2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',non_ordered_pair1) ).

fof(f6,axiom,
    ! [X2,X0,X1] :
      ( member(X0,non_ordered_pair(X1,X2))
      | ~ little_set(X0)
      | X0 != X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',non_ordered_pair2) ).

fof(f7,axiom,
    ! [X2,X0,X1] :
      ( member(X0,non_ordered_pair(X1,X2))
      | ~ little_set(X0)
      | X0 != X2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',non_ordered_pair3) ).

fof(f8,axiom,
    ! [X0,X1] : little_set(non_ordered_pair(X0,X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',non_ordered_pair4) ).

fof(f9,axiom,
    ! [X0] : singleton_set(X0) = non_ordered_pair(X0,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_set) ).

fof(f10,axiom,
    ! [X0,X1] : ordered_pair(X0,X1) = non_ordered_pair(singleton_set(X0),non_ordered_pair(X0,X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordered_pair) ).

fof(f162,axiom,
    little_set(a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_little_set) ).

fof(f163,axiom,
    little_set(b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_little_set) ).

fof(f165,axiom,
    little_set(d),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_little_set) ).

fof(f166,axiom,
    ordered_pair(a,b) = ordered_pair(c,d),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_ordered_pair) ).

fof(f167,negated_conjecture,
    b != d,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_second_components_equal) ).

fof(f169,plain,
    ! [X0,X1] : ordered_pair(X0,X1) = non_ordered_pair(non_ordered_pair(X0,X0),non_ordered_pair(X0,X1)),
    inference(definition_unfolding,[],[f10,f9]) ).

fof(f196,plain,
    non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b)) = non_ordered_pair(non_ordered_pair(c,c),non_ordered_pair(c,d)),
    inference(definition_unfolding,[],[f166,f169,f169]) ).

fof(f197,plain,
    ! [X2,X1] :
      ( member(X1,non_ordered_pair(X1,X2))
      | ~ little_set(X1) ),
    inference(equality_resolution,[],[f6]) ).

fof(f198,plain,
    ! [X2,X1] :
      ( member(X2,non_ordered_pair(X1,X2))
      | ~ little_set(X2) ),
    inference(equality_resolution,[],[f7]) ).

fof(f213,plain,
    ! [X0] :
      ( ~ member(X0,non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b)))
      | non_ordered_pair(c,c) = X0
      | non_ordered_pair(c,d) = X0 ),
    inference(superposition,[],[f5,f196]) ).

fof(f216,plain,
    ( member(non_ordered_pair(c,d),non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b)))
    | ~ little_set(non_ordered_pair(c,d)) ),
    inference(superposition,[],[f198,f196]) ).

fof(f217,plain,
    member(non_ordered_pair(c,d),non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),
    inference(forward_subsumption_resolution,[],[f216,f8]) ).

fof(f219,plain,
    ( non_ordered_pair(a,b) = non_ordered_pair(c,c)
    | non_ordered_pair(a,b) = non_ordered_pair(c,d)
    | ~ little_set(non_ordered_pair(a,b)) ),
    inference(resolution,[],[f213,f198]) ).

fof(f220,plain,
    ( non_ordered_pair(a,a) = non_ordered_pair(c,c)
    | non_ordered_pair(a,a) = non_ordered_pair(c,d)
    | ~ little_set(non_ordered_pair(a,a)) ),
    inference(resolution,[],[f213,f197]) ).

fof(f221,plain,
    ( non_ordered_pair(a,a) = non_ordered_pair(c,c)
    | non_ordered_pair(a,a) = non_ordered_pair(c,d) ),
    inference(forward_subsumption_resolution,[],[f220,f8]) ).

fof(f222,plain,
    ( non_ordered_pair(a,b) = non_ordered_pair(c,c)
    | non_ordered_pair(a,b) = non_ordered_pair(c,d) ),
    inference(forward_subsumption_resolution,[],[f219,f8]) ).

fof(f224,definition,
    ( spl0_1
  <=> non_ordered_pair(a,a) = non_ordered_pair(c,d) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f226,plain,
    ( non_ordered_pair(a,a) = non_ordered_pair(c,d)
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f224]) ).

fof(f228,definition,
    ( spl0_2
  <=> non_ordered_pair(a,a) = non_ordered_pair(c,c) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f229,plain,
    ( non_ordered_pair(a,a) != non_ordered_pair(c,c)
    | spl0_2 ),
    inference(avatar_component_clause,[],[f228]) ).

fof(f230,plain,
    ( non_ordered_pair(a,a) = non_ordered_pair(c,c)
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f228]) ).

fof(f231,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f221,f228,f224]) ).

fof(f233,definition,
    ( spl0_3
  <=> non_ordered_pair(a,b) = non_ordered_pair(c,d) ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

fof(f234,plain,
    ( non_ordered_pair(a,b) != non_ordered_pair(c,d)
    | spl0_3 ),
    inference(avatar_component_clause,[],[f233]) ).

fof(f235,plain,
    ( non_ordered_pair(a,b) = non_ordered_pair(c,d)
    | ~ spl0_3 ),
    inference(avatar_component_clause,[],[f233]) ).

fof(f237,definition,
    ( spl0_4
  <=> non_ordered_pair(a,b) = non_ordered_pair(c,c) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f239,plain,
    ( non_ordered_pair(a,b) = non_ordered_pair(c,c)
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f237]) ).

fof(f240,plain,
    ( spl0_3
    | spl0_4 ),
    inference(avatar_split_clause,[],[f222,f237,f233]) ).

fof(f246,plain,
    ( ! [X0] :
        ( ~ member(X0,non_ordered_pair(a,b))
        | c = X0
        | d = X0 )
    | ~ spl0_3 ),
    inference(superposition,[],[f5,f235]) ).

fof(f249,plain,
    ( member(d,non_ordered_pair(a,b))
    | ~ little_set(d)
    | ~ spl0_3 ),
    inference(superposition,[],[f198,f235]) ).

fof(f250,plain,
    ( member(d,non_ordered_pair(a,b))
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[],[f249,f165]) ).

fof(f252,plain,
    ( ! [X0] :
        ( ~ member(X0,non_ordered_pair(a,a))
        | c = X0
        | c = X0 )
    | ~ spl0_2 ),
    inference(superposition,[],[f5,f230]) ).

fof(f256,plain,
    ( ! [X0] :
        ( ~ member(X0,non_ordered_pair(a,a))
        | c = X0 )
    | ~ spl0_2 ),
    inference(duplicate_literal_removal,[],[f252]) ).

fof(f259,plain,
    ( a = d
    | b = d
    | ~ spl0_3 ),
    inference(resolution,[],[f250,f5]) ).

fof(f260,plain,
    ( a = d
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[],[f259,f167]) ).

fof(f263,plain,
    ( non_ordered_pair(c,d) = non_ordered_pair(d,b)
    | ~ spl0_3 ),
    inference(backward_demodulation,[],[f235,f260]) ).

fof(f266,plain,
    ( ! [X0] :
        ( ~ member(X0,non_ordered_pair(d,b))
        | c = X0
        | d = X0 )
    | ~ spl0_3 ),
    inference(backward_demodulation,[],[f246,f260]) ).

fof(f269,plain,
    ( ! [X0] :
        ( ~ member(X0,non_ordered_pair(d,d))
        | c = X0 )
    | ~ spl0_2
    | ~ spl0_3 ),
    inference(backward_demodulation,[],[f256,f260]) ).

fof(f273,plain,
    ( c = d
    | ~ little_set(d)
    | ~ spl0_2
    | ~ spl0_3 ),
    inference(resolution,[],[f269,f197]) ).

fof(f274,plain,
    ( c = d
    | ~ spl0_2
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[],[f273,f165]) ).

fof(f278,plain,
    ( ! [X0] :
        ( d = X0
        | ~ member(X0,non_ordered_pair(d,b))
        | d = X0 )
    | ~ spl0_2
    | ~ spl0_3 ),
    inference(backward_demodulation,[],[f266,f274]) ).

fof(f282,plain,
    ( ! [X0] :
        ( ~ member(X0,non_ordered_pair(d,b))
        | d = X0 )
    | ~ spl0_2
    | ~ spl0_3 ),
    inference(duplicate_literal_removal,[],[f278]) ).

fof(f287,plain,
    ( b = d
    | ~ little_set(b)
    | ~ spl0_2
    | ~ spl0_3 ),
    inference(resolution,[],[f282,f198]) ).

fof(f290,plain,
    ( ~ little_set(b)
    | ~ spl0_2
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[],[f287,f167]) ).

fof(f291,plain,
    ( $false
    | ~ spl0_2
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[],[f290,f163]) ).

fof(f292,plain,
    ( ~ spl0_2
    | ~ spl0_3 ),
    inference(avatar_contradiction_clause,[],[f291]) ).

fof(f293,plain,
    ( non_ordered_pair(c,d) = non_ordered_pair(d,d)
    | ~ spl0_1
    | ~ spl0_3 ),
    inference(forward_demodulation,[],[f226,f260]) ).

fof(f298,plain,
    ( non_ordered_pair(d,d) = non_ordered_pair(d,b)
    | ~ spl0_1
    | ~ spl0_3 ),
    inference(forward_demodulation,[],[f293,f263]) ).

fof(f306,plain,
    ( ! [X0] :
        ( ~ member(X0,non_ordered_pair(d,b))
        | d = X0
        | d = X0 )
    | ~ spl0_1
    | ~ spl0_3 ),
    inference(superposition,[],[f5,f298]) ).

fof(f310,plain,
    ( ! [X0] :
        ( ~ member(X0,non_ordered_pair(d,b))
        | d = X0 )
    | ~ spl0_1
    | ~ spl0_3 ),
    inference(duplicate_literal_removal,[],[f306]) ).

fof(f311,plain,
    ( b = d
    | ~ little_set(b)
    | ~ spl0_1
    | ~ spl0_3 ),
    inference(resolution,[],[f310,f198]) ).

fof(f314,plain,
    ( ~ little_set(b)
    | ~ spl0_1
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[],[f311,f167]) ).

fof(f315,plain,
    ( $false
    | ~ spl0_1
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[],[f314,f163]) ).

fof(f316,plain,
    ( ~ spl0_1
    | ~ spl0_3 ),
    inference(avatar_contradiction_clause,[],[f315]) ).

fof(f317,plain,
    ( non_ordered_pair(a,a) = non_ordered_pair(a,b)
    | ~ spl0_2
    | ~ spl0_4 ),
    inference(backward_demodulation,[],[f230,f239]) ).

fof(f321,plain,
    ( member(non_ordered_pair(c,d),non_ordered_pair(non_ordered_pair(a,b),non_ordered_pair(a,b)))
    | ~ spl0_2
    | ~ spl0_4 ),
    inference(backward_demodulation,[],[f217,f317]) ).

fof(f325,plain,
    ( ! [X0] :
        ( ~ member(X0,non_ordered_pair(a,b))
        | c = X0
        | c = X0 )
    | ~ spl0_4 ),
    inference(superposition,[],[f5,f239]) ).

fof(f329,plain,
    ( ! [X0] :
        ( ~ member(X0,non_ordered_pair(a,b))
        | c = X0 )
    | ~ spl0_4 ),
    inference(duplicate_literal_removal,[],[f325]) ).

fof(f332,plain,
    ( b = c
    | ~ little_set(b)
    | ~ spl0_4 ),
    inference(resolution,[],[f329,f198]) ).

fof(f333,plain,
    ( a = c
    | ~ little_set(a)
    | ~ spl0_4 ),
    inference(resolution,[],[f329,f197]) ).

fof(f334,plain,
    ( a = c
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f333,f162]) ).

fof(f335,plain,
    ( b = c
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f332,f163]) ).

fof(f337,plain,
    ( non_ordered_pair(a,b) != non_ordered_pair(a,d)
    | spl0_3
    | ~ spl0_4 ),
    inference(backward_demodulation,[],[f234,f334]) ).

fof(f339,plain,
    ( member(non_ordered_pair(a,d),non_ordered_pair(non_ordered_pair(a,b),non_ordered_pair(a,b)))
    | ~ spl0_2
    | ~ spl0_4 ),
    inference(backward_demodulation,[],[f321,f334]) ).

fof(f344,plain,
    ( a = b
    | ~ spl0_4 ),
    inference(backward_demodulation,[],[f334,f335]) ).

fof(f347,plain,
    ( non_ordered_pair(b,b) != non_ordered_pair(b,d)
    | spl0_3
    | ~ spl0_4 ),
    inference(backward_demodulation,[],[f337,f344]) ).

fof(f348,plain,
    ( member(non_ordered_pair(b,d),non_ordered_pair(non_ordered_pair(b,b),non_ordered_pair(b,b)))
    | ~ spl0_2
    | ~ spl0_4 ),
    inference(backward_demodulation,[],[f339,f344]) ).

fof(f384,plain,
    ( non_ordered_pair(b,b) = non_ordered_pair(b,d)
    | non_ordered_pair(b,b) = non_ordered_pair(b,d)
    | ~ spl0_2
    | ~ spl0_4 ),
    inference(resolution,[],[f348,f5]) ).

fof(f386,plain,
    ( non_ordered_pair(b,b) = non_ordered_pair(b,d)
    | ~ spl0_2
    | ~ spl0_4 ),
    inference(duplicate_literal_removal,[],[f384]) ).

fof(f387,plain,
    ( $false
    | ~ spl0_2
    | spl0_3
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f386,f347]) ).

fof(f388,plain,
    ( ~ spl0_2
    | spl0_3
    | ~ spl0_4 ),
    inference(avatar_contradiction_clause,[],[f387]) ).

fof(f390,plain,
    ( non_ordered_pair(a,a) != non_ordered_pair(b,b)
    | spl0_2
    | ~ spl0_4 ),
    inference(forward_demodulation,[],[f229,f335]) ).

fof(f396,plain,
    ( non_ordered_pair(b,b) != non_ordered_pair(b,b)
    | spl0_2
    | ~ spl0_4 ),
    inference(forward_demodulation,[],[f390,f344]) ).

fof(f397,plain,
    ( $false
    | spl0_2
    | ~ spl0_4 ),
    inference(trivial_inequality_removal,[],[f396]) ).

fof(f398,plain,
    ( spl0_2
    | ~ spl0_4 ),
    inference(avatar_contradiction_clause,[],[f397]) ).

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

cnf(s2,plain,
    ( spl0_3
    | spl0_4 ),
    inference(sat_conversion,[],[f240]) ).

cnf(s3,plain,
    ( ~ spl0_2
    | ~ spl0_3 ),
    inference(sat_conversion,[],[f292]) ).

cnf(s4,plain,
    ( ~ spl0_1
    | ~ spl0_3 ),
    inference(sat_conversion,[],[f316]) ).

cnf(s5,plain,
    ( ~ spl0_2
    | spl0_3
    | ~ spl0_4 ),
    inference(sat_conversion,[],[f388]) ).

cnf(s6,plain,
    ( spl0_2
    | ~ spl0_4 ),
    inference(sat_conversion,[],[f398]) ).

cnf(s8,plain,
    ( spl0_3
    | ~ spl0_2 ),
    inference(rat,[],[s2,s5]) ).

cnf(s9,plain,
    ~ spl0_2,
    inference(rat,[],[s8,s3]) ).

cnf(s10,plain,
    ~ spl0_4,
    inference(rat,[],[s6,s9]) ).

cnf(s11,plain,
    spl0_1,
    inference(rat,[],[s1,s9]) ).

cnf(s12,plain,
    spl0_3,
    inference(rat,[],[s2,s10]) ).

cnf(s13,plain,
    $false,
    inference(rat,[],[s4,s12,s11]) ).

fof(f405,plain,
    $false,
    inference(avatar_sat_refutation,[],[s13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET018-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.39  % Computer : n018.cluster.edu
% 0.13/0.39  % Model    : x86_64 x86_64
% 0.13/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39  % Memory   : 8046.5625MB
% 0.13/0.39  % OS       : Linux 6.8.0-71-generic
% 0.13/0.39  % CPULimit : 300
% 0.13/0.39  % WCLimit  : 300
% 0.13/0.39  % DateTime : Mon Sep 28 00:10:54 UTC 2026
% 0.13/0.39  % CPUTime  : 
% 0.13/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.43  Running first-order theorem proving
% 0.13/0.43  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
% 5.51/1.78  % (2871173)Input is clausal, will run a generic CNF schedule.
% 5.51/1.78  % (2871182)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2955398294:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 5.51/1.78  % (2871182)Refutation not found, incomplete strategy
% 5.51/1.78  % (2871182)------------------------------
% 5.51/1.78  % (2871182)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.51/1.78  % (2871182)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.51/1.78  % (2871182)CaDiCaL version: 2.1.3
% 5.51/1.78  % (2871182)Termination reason: Refutation not found, incomplete strategy
% 5.51/1.78  % (2871182)Time elapsed: 0.001 s
% 5.51/1.78  % (2871182)Peak memory usage: 88 MB
% 5.51/1.78  % (2871182)Instructions burned: 1 (million)
% 5.51/1.78  % (2871179)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1806401641:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 5.51/1.78  % (2871178)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=2713224445:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 5.51/1.78  % (2871181)lrs+10_1_sil=8000:sp=occurrence:random_seed=2326619576:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 5.51/1.78  % (2871180)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=319112866:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 5.51/1.78  % (2871181)Refutation not found, incomplete strategy
% 5.51/1.78  % (2871181)------------------------------
% 5.51/1.78  % (2871181)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.51/1.78  % (2871181)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.51/1.78  % (2871181)CaDiCaL version: 2.1.3
% 5.51/1.78  % (2871181)Termination reason: Refutation not found, incomplete strategy
% 5.51/1.78  % (2871181)Time elapsed: 0.001 s
% 5.51/1.78  % (2871181)Peak memory usage: 87 MB
% 5.51/1.78  % (2871184)dis-21_1_sil=8000:lcm=predicate:random_seed=1577599062: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)
% 5.51/1.78  % (2871183)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3980845390:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 5.51/1.78  % (2871184)Instruction limit reached! 
% 5.51/1.78  % (2871184)------------------------------
% 5.51/1.78  % (2871184)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.51/1.78  % (2871184)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.51/1.78  % (2871184)CaDiCaL version: 2.1.3
% 5.51/1.78  % (2871184)Termination reason: Instruction limit
% 5.51/1.78  % (2871184)Termination phase: Saturation
% 5.51/1.78  % (2871184)Time elapsed: 0.061 s
% 5.51/1.78  % (2871184)Peak memory usage: 88 MB
% 5.51/1.78  % (2871184)Instructions burned: 118 (million)
% 5.51/1.78  % (2871182)------------------------------
% 5.51/1.78  % (2871182)------------------------------
% 5.51/1.78  % (2871183)Instruction limit reached! 
% 5.51/1.78  % (2871183)------------------------------
% 5.51/1.78  % (2871183)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.51/1.78  % (2871183)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.51/1.78  % (2871183)CaDiCaL version: 2.1.3
% 5.51/1.78  % (2871183)Termination reason: Instruction limit
% 5.51/1.78  % (2871183)Termination phase: Saturation
% 5.51/1.78  % (2871183)Time elapsed: 0.126 s
% 5.51/1.78  % (2871183)Peak memory usage: 90 MB
% 5.51/1.78  % (2871183)Instructions burned: 180 (million)
% 5.51/1.78  % (2871193)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=3283722886: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)
% 5.51/1.78  % (2871192)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=1387919592:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 5.51/1.78  % (2871192)Refutation not found, incomplete strategy
% 5.51/1.78  % (2871192)------------------------------
% 5.51/1.78  % (2871192)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.51/1.78  % (2871192)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.51/1.78  % (2871192)CaDiCaL version: 2.1.3
% 5.51/1.78  % (2871192)Termination reason: Refutation not found, incomplete strategy
% 5.51/1.78  % (2871192)Time elapsed: 0.001 s
% 5.51/1.78  % (2871192)Peak memory usage: 87 MB
% 5.51/1.78  % (2871181)------------------------------
% 5.51/1.78  % (2871181)------------------------------
% 5.51/1.78  % (2871193)Instruction limit reached! 
% 5.51/1.78  % (2871193)------------------------------
% 5.51/1.78  % (2871193)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.51/1.78  % (2871193)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.51/1.78  % (2871193)CaDiCaL version: 2.1.3
% 5.51/1.78  % (2871193)Termination reason: Instruction limit
% 5.51/1.78  % (2871193)Termination phase: Saturation
% 5.51/1.78  % (2871193)Time elapsed: 0.054 s
% 5.51/1.78  % (2871193)Peak memory usage: 90 MB
% 5.51/1.78  % (2871193)Instructions burned: 189 (million)
% 5.51/1.78  % (2871194)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=1159808980:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 5.51/1.78  % (2871197)lrs+10_64_to=lpo:sil=8000:random_seed=1360857392:i=126:bd=preordered_2996 on theBenchmark for (2996ds/126Mi)
% 5.51/1.78  % (2871197)Instruction limit reached! 
% 5.51/1.78  % (2871197)------------------------------
% 5.51/1.78  % (2871197)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.51/1.78  % (2871197)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.51/1.78  % (2871197)CaDiCaL version: 2.1.3
% 5.51/1.78  % (2871197)Termination reason: Instruction limit
% 5.51/1.78  % (2871197)Termination phase: Saturation
% 5.51/1.78  % (2871197)Time elapsed: 0.040 s
% 5.51/1.78  % (2871197)Peak memory usage: 90 MB
% 5.51/1.78  % (2871197)Instructions burned: 129 (million)
% 5.51/1.78  % (2871198)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=767064504:avsq=on:i=194:fgj=on:bd=preordered_2996 on theBenchmark for (2996ds/194Mi)
% 5.51/1.78  % (2871194)Instruction limit reached! 
% 5.51/1.78  % (2871194)------------------------------
% 5.51/1.78  % (2871194)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.51/1.78  % (2871194)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.51/1.78  % (2871194)CaDiCaL version: 2.1.3
% 5.51/1.78  % (2871194)Termination reason: Instruction limit
% 5.51/1.78  % (2871194)Termination phase: Saturation
% 5.51/1.78  % (2871194)Time elapsed: 0.136 s
% 5.51/1.78  % (2871194)Peak memory usage: 90 MB
% 5.51/1.78  % (2871194)Instructions burned: 220 (million)
% 5.51/1.78  % (2871192)------------------------------
% 5.51/1.78  % (2871192)------------------------------
% 5.51/1.78  % (2871201)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=764177105:i=157:gtg=all_2994 on theBenchmark for (2994ds/157Mi)
% 5.51/1.78  % (2871201)Instruction limit reached! 
% 5.51/1.78  % (2871201)------------------------------
% 5.51/1.78  % (2871201)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.51/1.78  % (2871201)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.51/1.78  % (2871198)Instruction limit reached! 
% 5.51/1.78  % (2871198)------------------------------
% 5.51/1.78  % (2871198)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.51/1.78  % (2871201)CaDiCaL version: 2.1.3
% 5.51/1.78  % (2871201)Termination reason: Instruction limit
% 5.51/1.78  % (2871201)Termination phase: Saturation
% 5.51/1.78  % (2871201)Time elapsed: 0.052 s
% 5.51/1.78  % (2871198)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.51/1.78  % (2871201)Peak memory usage: 91 MB
% 5.51/1.78  % (2871201)Instructions burned: 157 (million)
% 5.51/1.78  % (2871198)CaDiCaL version: 2.1.3
% 5.51/1.78  % (2871198)Termination reason: Instruction limit
% 5.51/1.78  % (2871198)Termination phase: Saturation
% 5.51/1.78  % (2871198)Time elapsed: 0.126 s
% 5.51/1.78  % (2871198)Peak memory usage: 89 MB
% 5.51/1.78  % (2871198)Instructions burned: 195 (million)
% 5.51/1.78  % (2871203)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=914137388:i=3394:sd=4:ss=included:sgt=64_2994 on theBenchmark for (2994ds/3394Mi)
% 5.51/1.78  % (2871205)lrs+1011_5_to=lpo:sil=8000:tgt=full:plsq=on:prc=on:drc=off:plsqr=31,4:sp=occurrence:urr=on:nwc=0.8:s2agt=16:br=off:random_seed=1389168987:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2993 on theBenchmark for (2993ds/106Mi)
% 5.51/1.78  % (2871205)Refutation not found, incomplete strategy
% 5.51/1.78  % (2871205)------------------------------
% 5.51/1.78  % (2871205)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.51/1.78  % (2871205)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.51/1.78  % (2871205)CaDiCaL version: 2.1.3
% 5.51/1.78  % (2871205)Termination reason: Refutation not found, incomplete strategy
% 5.51/1.78  % (2871205)Time elapsed: 0.001 s
% 5.51/1.78  % (2871205)Peak memory usage: 88 MB
% 5.51/1.78  % (2871180)First to succeed.
% 5.51/1.78  % (2871180)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2871173"
% 5.51/1.78  % (2871207)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=573397790:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2993 on theBenchmark for (2993ds/242Mi)
% 5.51/1.78  % (2871206)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=967259789:i=107_2993 on theBenchmark for (2993ds/107Mi)
% 5.51/1.78  % (2871178)Also succeeded, but the first one will report.
% 5.51/1.78  % (2871206)Instruction limit reached! 
% 5.51/1.78  % (2871206)------------------------------
% 5.51/1.78  % (2871206)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.51/1.78  % (2871206)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.51/1.78  % (2871206)CaDiCaL version: 2.1.3
% 5.51/1.78  % (2871206)Termination reason: Instruction limit
% 5.51/1.78  % (2871206)Termination phase: Saturation
% 5.51/1.78  % (2871206)Time elapsed: 0.078 s
% 5.51/1.78  % (2871206)Peak memory usage: 90 MB
% 5.51/1.78  % (2871206)Instructions burned: 107 (million)
% 5.51/1.78  % (2871180)Refutation found. Thanks to Tanya!
% 5.51/1.78  % SZS status Unsatisfiable for theBenchmark
% 5.51/1.78  % SZS output start Proof for theBenchmark
% See solution above
% 7.03/1.97  % (2871180)------------------------------
% 7.03/1.97  % (2871180)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.03/1.97  % (2871180)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.03/1.97  % (2871180)CaDiCaL version: 2.1.3
% 7.03/1.97  % (2871180)Termination reason: Refutation
% 7.03/1.97  % (2871180)Time elapsed: 0.602 s
% 7.03/1.97  % (2871180)Peak memory usage: 130 MB
% 7.03/1.97  % (2871180)Instructions burned: 997 (million)
% 7.03/1.97  % (2871180)------------------------------
% 7.03/1.97  % (2871180)------------------------------
% 7.03/1.97  % (2871173)Success in time 0.917 s
% 7.03/1.97  % Vampire exiting
%------------------------------------------------------------------------------