↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n006.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:37 PM UTC 2026

% Result   : Unsatisfiable 4.53s 1.57s
% Output   : Refutation 5.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   94 (  27 unt;   9 def)
%            Number of atoms       :  205 (  56 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  206 (  95   ~; 106   |;   0   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    9 (   7 usr;   6 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   6 con; 0-2 aty)
%            Number of variables   :   63 (   0 sgn  63   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X0,X1] :
      ( member(f1(X0,X1),X1)
      | member(f1(X0,X1),X0)
      | X0 = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',extensionality2) ).

fof(f4,axiom,
    ! [X0,X1] :
      ( ~ member(f1(X0,X1),X1)
      | ~ member(f1(X0,X1),X0)
      | X0 = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',extensionality3) ).

fof(f9,axiom,
    ! [X0] : singleton_set(X0) = non_ordered_pair(X0,X0),
    file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',ordered_pair) ).

fof(f17,axiom,
    ! [X0,X1] :
      ( ~ member(X0,first(X1))
      | little_set(f4(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',first1) ).

fof(f19,axiom,
    ! [X0,X1] :
      ( ~ member(X0,first(X1))
      | X1 = ordered_pair(f4(X0,X1),f5(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',first3) ).

fof(f20,plain,
    ! [X0,X1] :
      ( ~ member(X0,first(X1))
      | ordered_pair(f4(X0,X1),f5(X0,X1)) = X1 ),
    inference(reorient_equations,[],[f19]) ).

fof(f21,axiom,
    ! [X0,X1] :
      ( member(X0,f4(X0,X1))
      | ~ member(X0,first(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',first4) ).

fof(f22,axiom,
    ! [X2,X3,X0,X1] :
      ( member(X0,first(X1))
      | ~ little_set(X2)
      | ~ little_set(X3)
      | X1 != ordered_pair(X2,X3)
      | ~ member(X0,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',first5) ).

fof(f23,plain,
    ! [X2,X3,X0,X1] :
      ( member(X0,first(X1))
      | ~ little_set(X2)
      | ~ little_set(X3)
      | ordered_pair(X2,X3) != X1
      | ~ member(X0,X2) ),
    inference(reorient_equations,[],[f22]) ).

fof(f162,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ little_set(X0)
      | ~ little_set(X1)
      | ordered_pair(X0,X2) != ordered_pair(X1,X3)
      | X0 = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',first_components_are_equal) ).

fof(f163,plain,
    ! [X2,X3,X0,X1] :
      ( ~ little_set(X0)
      | ~ little_set(X1)
      | ordered_pair(X1,X3) != ordered_pair(X0,X2)
      | X0 = X1 ),
    inference(reorient_equations,[],[f162]) ).

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

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

fof(f169,negated_conjecture,
    first(ordered_pair(a,b)) != a,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_first_is_first) ).

fof(f170,plain,
    a != first(ordered_pair(a,b)),
    inference(reorient_equations,[],[f169]) ).

fof(f172,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(f176,plain,
    ! [X0,X1] :
      ( ~ member(X0,first(X1))
      | non_ordered_pair(non_ordered_pair(f4(X0,X1),f4(X0,X1)),non_ordered_pair(f4(X0,X1),f5(X0,X1))) = X1 ),
    inference(definition_unfolding,[],[f20,f172]) ).

fof(f177,plain,
    ! [X2,X3,X0,X1] :
      ( member(X0,first(X1))
      | ~ little_set(X2)
      | ~ little_set(X3)
      | non_ordered_pair(non_ordered_pair(X2,X2),non_ordered_pair(X2,X3)) != X1
      | ~ member(X0,X2) ),
    inference(definition_unfolding,[],[f23,f172]) ).

fof(f199,plain,
    ! [X2,X3,X0,X1] :
      ( non_ordered_pair(non_ordered_pair(X1,X1),non_ordered_pair(X1,X3)) != non_ordered_pair(non_ordered_pair(X0,X0),non_ordered_pair(X0,X2))
      | ~ little_set(X1)
      | ~ little_set(X0)
      | X0 = X1 ),
    inference(definition_unfolding,[],[f163,f172,f172]) ).

fof(f201,plain,
    a != first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),
    inference(definition_unfolding,[],[f170,f172]) ).

fof(f205,plain,
    ! [X2,X3,X0] :
      ( member(X0,first(non_ordered_pair(non_ordered_pair(X2,X2),non_ordered_pair(X2,X3))))
      | ~ little_set(X2)
      | ~ little_set(X3)
      | ~ member(X0,X2) ),
    inference(equality_resolution,[],[f177]) ).

fof(f216,definition,
    sF0 = non_ordered_pair(a,a),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f217,plain,
    non_ordered_pair(a,a) = sF0,
    inference(reorient_equations,[],[f216]) ).

fof(f218,definition,
    sF1 = non_ordered_pair(a,b),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f219,plain,
    non_ordered_pair(a,b) = sF1,
    inference(reorient_equations,[],[f218]) ).

fof(f220,definition,
    sF2 = non_ordered_pair(sF0,sF1),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f221,plain,
    non_ordered_pair(sF0,sF1) = sF2,
    inference(reorient_equations,[],[f220]) ).

fof(f222,definition,
    sF3 = first(sF2),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f223,plain,
    first(sF2) = sF3,
    inference(reorient_equations,[],[f222]) ).

fof(f224,plain,
    a != sF3,
    inference(definition_folding,[],[f201,f223,f221,f219,f217]) ).

fof(f285,plain,
    ! [X0,X1] :
      ( non_ordered_pair(non_ordered_pair(X0,X0),non_ordered_pair(X0,X1)) != non_ordered_pair(non_ordered_pair(a,a),sF1)
      | ~ little_set(X0)
      | ~ little_set(a)
      | a = X0 ),
    inference(superposition,[],[f199,f219]) ).

fof(f293,plain,
    ! [X0,X1] :
      ( non_ordered_pair(non_ordered_pair(X0,X0),non_ordered_pair(X0,X1)) != non_ordered_pair(non_ordered_pair(a,a),sF1)
      | ~ little_set(X0)
      | a = X0 ),
    inference(forward_subsumption_resolution,[],[f285,f167]) ).

fof(f300,plain,
    ! [X0,X1] :
      ( non_ordered_pair(non_ordered_pair(X0,X0),non_ordered_pair(X0,X1)) != non_ordered_pair(sF0,sF1)
      | ~ little_set(X0)
      | a = X0 ),
    inference(forward_demodulation,[],[f293,f217]) ).

fof(f302,plain,
    ! [X0,X1] :
      ( non_ordered_pair(non_ordered_pair(X0,X0),non_ordered_pair(X0,X1)) != sF2
      | ~ little_set(X0)
      | a = X0 ),
    inference(forward_demodulation,[],[f300,f221]) ).

fof(f314,plain,
    ! [X0] :
      ( ~ member(X0,sF3)
      | sF2 = non_ordered_pair(non_ordered_pair(f4(X0,sF2),f4(X0,sF2)),non_ordered_pair(f4(X0,sF2),f5(X0,sF2))) ),
    inference(superposition,[],[f176,f223]) ).

fof(f323,plain,
    ! [X0] :
      ( member(X0,first(non_ordered_pair(non_ordered_pair(a,a),sF1)))
      | ~ little_set(a)
      | ~ little_set(b)
      | ~ member(X0,a) ),
    inference(superposition,[],[f205,f219]) ).

fof(f326,plain,
    ! [X0] :
      ( member(X0,first(non_ordered_pair(non_ordered_pair(a,a),sF1)))
      | ~ little_set(b)
      | ~ member(X0,a) ),
    inference(forward_subsumption_resolution,[],[f323,f167]) ).

fof(f329,plain,
    ! [X0] :
      ( member(X0,first(non_ordered_pair(non_ordered_pair(a,a),sF1)))
      | ~ member(X0,a) ),
    inference(forward_subsumption_resolution,[],[f326,f168]) ).

fof(f330,plain,
    ! [X0] :
      ( member(X0,first(non_ordered_pair(sF0,sF1)))
      | ~ member(X0,a) ),
    inference(forward_demodulation,[],[f329,f217]) ).

fof(f331,plain,
    ! [X0] :
      ( member(X0,first(sF2))
      | ~ member(X0,a) ),
    inference(forward_demodulation,[],[f330,f221]) ).

fof(f332,plain,
    ! [X0] :
      ( ~ member(X0,a)
      | member(X0,sF3) ),
    inference(forward_demodulation,[],[f331,f223]) ).

fof(f370,plain,
    ! [X0] :
      ( little_set(f4(X0,sF2))
      | ~ member(X0,sF3) ),
    inference(superposition,[],[f17,f223]) ).

fof(f637,plain,
    ! [X0] :
      ( member(f1(X0,sF3),X0)
      | sF3 = X0
      | sF2 = non_ordered_pair(non_ordered_pair(f4(f1(X0,sF3),sF2),f4(f1(X0,sF3),sF2)),non_ordered_pair(f4(f1(X0,sF3),sF2),f5(f1(X0,sF3),sF2))) ),
    inference(resolution,[],[f3,f314]) ).

fof(f1277,plain,
    ( a = sF3
    | sF2 = non_ordered_pair(non_ordered_pair(f4(f1(a,sF3),sF2),f4(f1(a,sF3),sF2)),non_ordered_pair(f4(f1(a,sF3),sF2),f5(f1(a,sF3),sF2)))
    | member(f1(a,sF3),sF3) ),
    inference(resolution,[],[f637,f332]) ).

fof(f1327,plain,
    ( a = sF3
    | sF2 = non_ordered_pair(non_ordered_pair(f4(f1(a,sF3),sF2),f4(f1(a,sF3),sF2)),non_ordered_pair(f4(f1(a,sF3),sF2),f5(f1(a,sF3),sF2))) ),
    inference(forward_subsumption_resolution,[],[f1277,f314]) ).

fof(f1349,plain,
    sF2 = non_ordered_pair(non_ordered_pair(f4(f1(a,sF3),sF2),f4(f1(a,sF3),sF2)),non_ordered_pair(f4(f1(a,sF3),sF2),f5(f1(a,sF3),sF2))),
    inference(forward_subsumption_resolution,[],[f1327,f224]) ).

fof(f1392,definition,
    ( spl4_58
  <=> sF2 = non_ordered_pair(non_ordered_pair(f4(f1(a,sF3),sF2),f4(f1(a,sF3),sF2)),non_ordered_pair(f4(f1(a,sF3),sF2),f5(f1(a,sF3),sF2))) ),
    introduced(definition,[new_symbols(definition,[spl4_58])],[avatar_definition]) ).

fof(f1394,plain,
    ( sF2 = non_ordered_pair(non_ordered_pair(f4(f1(a,sF3),sF2),f4(f1(a,sF3),sF2)),non_ordered_pair(f4(f1(a,sF3),sF2),f5(f1(a,sF3),sF2)))
    | ~ spl4_58 ),
    inference(avatar_component_clause,[],[f1392]) ).

fof(f1396,plain,
    spl4_58,
    inference(avatar_split_clause,[],[f1349,f1392]) ).

fof(f1425,plain,
    ( sF2 != sF2
    | ~ little_set(f4(f1(a,sF3),sF2))
    | a = f4(f1(a,sF3),sF2)
    | ~ spl4_58 ),
    inference(superposition,[],[f302,f1394]) ).

fof(f1451,plain,
    ( ~ little_set(f4(f1(a,sF3),sF2))
    | a = f4(f1(a,sF3),sF2)
    | ~ spl4_58 ),
    inference(trivial_inequality_removal,[],[f1425]) ).

fof(f1476,definition,
    ( spl4_59
  <=> little_set(f4(f1(a,sF3),sF2)) ),
    introduced(definition,[new_symbols(definition,[spl4_59])],[avatar_definition]) ).

fof(f1478,plain,
    ( ~ little_set(f4(f1(a,sF3),sF2))
    | spl4_59 ),
    inference(avatar_component_clause,[],[f1476]) ).

fof(f1488,definition,
    ( spl4_62
  <=> a = f4(f1(a,sF3),sF2) ),
    introduced(definition,[new_symbols(definition,[spl4_62])],[avatar_definition]) ).

fof(f1490,plain,
    ( a = f4(f1(a,sF3),sF2)
    | ~ spl4_62 ),
    inference(avatar_component_clause,[],[f1488]) ).

fof(f1491,plain,
    ( spl4_62
    | ~ spl4_59
    | ~ spl4_58 ),
    inference(avatar_split_clause,[],[f1451,f1392,f1476,f1488]) ).

fof(f1623,plain,
    ( ~ member(f1(a,sF3),sF3)
    | spl4_59 ),
    inference(resolution,[],[f1478,f370]) ).

fof(f1624,plain,
    ( member(f1(a,sF3),a)
    | a = sF3
    | spl4_59 ),
    inference(resolution,[],[f1623,f3]) ).

fof(f1625,plain,
    ( member(f1(a,sF3),a)
    | spl4_59 ),
    inference(forward_subsumption_resolution,[],[f1624,f224]) ).

fof(f1627,plain,
    ( member(f1(a,sF3),sF3)
    | spl4_59 ),
    inference(resolution,[],[f1625,f332]) ).

fof(f1629,plain,
    ( $false
    | spl4_59 ),
    inference(forward_subsumption_resolution,[],[f1627,f1623]) ).

fof(f1630,plain,
    spl4_59,
    inference(avatar_contradiction_clause,[],[f1629]) ).

fof(f1635,plain,
    ( member(f1(a,sF3),a)
    | ~ member(f1(a,sF3),first(sF2))
    | ~ spl4_62 ),
    inference(superposition,[],[f21,f1490]) ).

fof(f1636,plain,
    ( ~ member(f1(a,sF3),sF3)
    | member(f1(a,sF3),a)
    | ~ spl4_62 ),
    inference(forward_demodulation,[],[f1635,f223]) ).

fof(f1639,definition,
    ( spl4_84
  <=> member(f1(a,sF3),a) ),
    introduced(definition,[new_symbols(definition,[spl4_84])],[avatar_definition]) ).

fof(f1641,plain,
    ( member(f1(a,sF3),a)
    | ~ spl4_84 ),
    inference(avatar_component_clause,[],[f1639]) ).

fof(f1643,definition,
    ( spl4_85
  <=> member(f1(a,sF3),sF3) ),
    introduced(definition,[new_symbols(definition,[spl4_85])],[avatar_definition]) ).

fof(f1644,plain,
    ( member(f1(a,sF3),sF3)
    | ~ spl4_85 ),
    inference(avatar_component_clause,[],[f1643]) ).

fof(f1645,plain,
    ( ~ member(f1(a,sF3),sF3)
    | spl4_85 ),
    inference(avatar_component_clause,[],[f1643]) ).

fof(f1646,plain,
    ( spl4_84
    | ~ spl4_85
    | ~ spl4_62 ),
    inference(avatar_split_clause,[],[f1636,f1488,f1643,f1639]) ).

fof(f1647,plain,
    ( member(f1(a,sF3),a)
    | a = sF3
    | spl4_85 ),
    inference(resolution,[],[f1645,f3]) ).

fof(f1648,plain,
    ( member(f1(a,sF3),a)
    | spl4_85 ),
    inference(forward_subsumption_resolution,[],[f1647,f224]) ).

fof(f1649,plain,
    ( spl4_84
    | spl4_85 ),
    inference(avatar_split_clause,[],[f1648,f1643,f1639]) ).

fof(f1651,plain,
    ( member(f1(a,sF3),sF3)
    | ~ spl4_84 ),
    inference(resolution,[],[f1641,f332]) ).

fof(f1653,plain,
    ( $false
    | ~ spl4_84
    | spl4_85 ),
    inference(forward_subsumption_resolution,[],[f1651,f1645]) ).

fof(f1654,plain,
    ( ~ spl4_84
    | spl4_85 ),
    inference(avatar_contradiction_clause,[],[f1653]) ).

fof(f1656,plain,
    ( ~ member(f1(a,sF3),a)
    | a = sF3
    | ~ spl4_85 ),
    inference(resolution,[],[f1644,f4]) ).

fof(f1659,plain,
    ( a = sF3
    | ~ spl4_84
    | ~ spl4_85 ),
    inference(forward_subsumption_resolution,[],[f1656,f1641]) ).

fof(f1660,plain,
    ( $false
    | ~ spl4_84
    | ~ spl4_85 ),
    inference(forward_subsumption_resolution,[],[f1659,f224]) ).

fof(f1661,plain,
    ( ~ spl4_84
    | ~ spl4_85 ),
    inference(avatar_contradiction_clause,[],[f1660]) ).

cnf(s65,plain,
    spl4_58,
    inference(sat_conversion,[],[f1396]) ).

cnf(s67,plain,
    ( ~ spl4_58
    | ~ spl4_59
    | spl4_62 ),
    inference(sat_conversion,[],[f1491]) ).

cnf(s89,plain,
    spl4_59,
    inference(sat_conversion,[],[f1630]) ).

cnf(s91,plain,
    ( ~ spl4_62
    | spl4_84
    | ~ spl4_85 ),
    inference(sat_conversion,[],[f1646]) ).

cnf(s92,plain,
    ( spl4_84
    | spl4_85 ),
    inference(sat_conversion,[],[f1649]) ).

cnf(s93,plain,
    ( ~ spl4_84
    | spl4_85 ),
    inference(sat_conversion,[],[f1654]) ).

cnf(s95,plain,
    ( ~ spl4_84
    | ~ spl4_85 ),
    inference(sat_conversion,[],[f1661]) ).

cnf(s105,plain,
    ( ~ spl4_58
    | spl4_62 ),
    inference(rat,[],[s67,s89]) ).

cnf(s108,plain,
    spl4_62,
    inference(rat,[],[s105,s65]) ).

cnf(s111,plain,
    spl4_84,
    inference(rat,[],[s91,s92,s108]) ).

cnf(s112,plain,
    ~ spl4_85,
    inference(rat,[],[s95,s111]) ).

cnf(s114,plain,
    $false,
    inference(rat,[],[s93,s112,s111]) ).

fof(f1662,plain,
    $false,
    inference(avatar_sat_refutation,[],[s114]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET020-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38  % Computer : n006.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Mon Sep 28 00:09:41 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42  Running first-order theorem proving
% 0.10/0.42  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.53/1.57  % (3473372)Input is clausal, will run a generic CNF schedule.
% 4.53/1.57  % (3473377)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=3537135902:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 4.53/1.57  % (3473381)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1213239851:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 4.53/1.57  % (3473383)dis-21_1_sil=8000:lcm=predicate:random_seed=527839337: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)
% 4.53/1.57  % (3473380)lrs+10_1_sil=8000:sp=occurrence:random_seed=1032872344:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 4.53/1.57  % (3473379)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3992936182:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 4.53/1.57  % (3473378)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=717481747:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 4.53/1.57  % (3473382)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1626880917:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 4.53/1.57  % (3473380)Refutation not found, incomplete strategy
% 4.53/1.57  % (3473380)------------------------------
% 4.53/1.57  % (3473380)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.53/1.57  % (3473380)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.53/1.57  % (3473380)CaDiCaL version: 2.1.3
% 4.53/1.57  % (3473380)Termination reason: Refutation not found, incomplete strategy
% 4.53/1.57  % (3473380)Time elapsed: 0.001 s
% 4.53/1.57  % (3473380)Peak memory usage: 88 MB
% 4.53/1.57  % (3473381)Refutation not found, incomplete strategy
% 4.53/1.57  % (3473381)------------------------------
% 4.53/1.57  % (3473381)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.53/1.57  % (3473381)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.53/1.57  % (3473381)CaDiCaL version: 2.1.3
% 4.53/1.57  % (3473381)Termination reason: Refutation not found, incomplete strategy
% 4.53/1.57  % (3473381)Time elapsed: 0.002 s
% 4.53/1.57  % (3473381)Peak memory usage: 88 MB
% 4.53/1.57  % (3473381)Instructions burned: 1 (million)
% 4.53/1.57  % (3473383)Instruction limit reached! 
% 4.53/1.57  % (3473383)------------------------------
% 4.53/1.57  % (3473383)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.53/1.57  % (3473383)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.53/1.57  % (3473383)CaDiCaL version: 2.1.3
% 4.53/1.57  % (3473383)Termination reason: Instruction limit
% 4.53/1.57  % (3473383)Termination phase: Saturation
% 4.53/1.57  % (3473383)Time elapsed: 0.072 s
% 4.53/1.57  % (3473383)Peak memory usage: 89 MB
% 4.53/1.57  % (3473383)Instructions burned: 117 (million)
% 4.53/1.57  % (3473382)Instruction limit reached! 
% 4.53/1.57  % (3473382)------------------------------
% 4.53/1.57  % (3473382)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.53/1.57  % (3473382)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.53/1.57  % (3473382)CaDiCaL version: 2.1.3
% 4.53/1.57  % (3473382)Termination reason: Instruction limit
% 4.53/1.57  % (3473382)Termination phase: Saturation
% 4.53/1.57  % (3473382)Time elapsed: 0.121 s
% 4.53/1.57  % (3473382)Peak memory usage: 90 MB
% 4.53/1.57  % (3473382)Instructions burned: 180 (million)
% 4.53/1.57  % (3473391)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=4026046807:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 4.53/1.57  % (3473391)Refutation not found, incomplete strategy
% 4.53/1.57  % (3473391)------------------------------
% 4.53/1.57  % (3473391)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.53/1.57  % (3473391)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.53/1.57  % (3473391)CaDiCaL version: 2.1.3
% 4.53/1.57  % (3473391)Termination reason: Refutation not found, incomplete strategy
% 4.53/1.57  % (3473391)Time elapsed: 0.001 s
% 4.53/1.57  % (3473391)Peak memory usage: 88 MB
% 4.53/1.57  % (3473381)------------------------------
% 4.53/1.57  % (3473381)------------------------------
% 4.53/1.57  % (3473380)------------------------------
% 4.53/1.57  % (3473380)------------------------------
% 4.53/1.57  % (3473392)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=2812662712: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)
% 4.53/1.57  % (3473392)Instruction limit reached! 
% 4.53/1.57  % (3473392)------------------------------
% 4.53/1.57  % (3473392)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.53/1.57  % (3473392)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.53/1.57  % (3473392)CaDiCaL version: 2.1.3
% 4.53/1.57  % (3473392)Termination reason: Instruction limit
% 4.53/1.57  % (3473392)Termination phase: Saturation
% 4.53/1.57  % (3473392)Time elapsed: 0.100 s
% 4.53/1.57  % (3473392)Peak memory usage: 90 MB
% 4.53/1.57  % (3473392)Instructions burned: 189 (million)
% 4.53/1.57  % (3473395)lrs+10_64_to=lpo:sil=8000:random_seed=1659738719:i=126:bd=preordered_2995 on theBenchmark for (2995ds/126Mi)
% 4.53/1.57  % (3473394)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=1772457007:st=4:i=219:sd=3:ss=axioms_2995 on theBenchmark for (2995ds/219Mi)
% 4.53/1.57  % (3473394)Refutation not found, incomplete strategy
% 4.53/1.57  % (3473394)------------------------------
% 4.53/1.57  % (3473394)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.53/1.57  % (3473394)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.53/1.57  % (3473394)CaDiCaL version: 2.1.3
% 4.53/1.57  % (3473394)Termination reason: Refutation not found, incomplete strategy
% 4.53/1.57  % (3473394)Time elapsed: 0.003 s
% 4.53/1.57  % (3473394)Peak memory usage: 87 MB
% 4.53/1.57  % (3473394)Instructions burned: 3 (million)
% 4.53/1.57  % (3473377)First to succeed.
% 4.53/1.57  % (3473377)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3473372"
% 4.53/1.57  % (3473391)------------------------------
% 4.53/1.57  % (3473391)------------------------------
% 4.53/1.57  % (3473395)Instruction limit reached! 
% 4.53/1.57  % (3473395)------------------------------
% 4.53/1.57  % (3473395)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.53/1.57  % (3473395)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.53/1.57  % (3473395)CaDiCaL version: 2.1.3
% 4.53/1.57  % (3473395)Termination reason: Instruction limit
% 4.53/1.57  % (3473395)Termination phase: Saturation
% 4.53/1.57  % (3473395)Time elapsed: 0.076 s
% 4.53/1.57  % (3473395)Peak memory usage: 90 MB
% 4.53/1.57  % (3473395)Instructions burned: 126 (million)
% 4.53/1.57  % (3473397)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=2651673108:avsq=on:i=194:fgj=on:bd=preordered_2994 on theBenchmark for (2994ds/194Mi)
% 4.53/1.57  % (3473377)Refutation found. Thanks to Tanya!
% 4.53/1.57  % SZS status Unsatisfiable for theBenchmark
% 4.53/1.57  % SZS output start Proof for theBenchmark
% See solution above
% 5.56/1.76  % (3473377)------------------------------
% 5.56/1.76  % (3473377)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.56/1.76  % (3473377)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.56/1.76  % (3473377)CaDiCaL version: 2.1.3
% 5.56/1.76  % (3473377)Termination reason: Refutation
% 5.56/1.76  % (3473377)Time elapsed: 0.420 s
% 5.56/1.76  % (3473377)Peak memory usage: 132 MB
% 5.56/1.76  % (3473377)Instructions burned: 1159 (million)
% 5.56/1.76  % (3473377)------------------------------
% 5.56/1.76  % (3473377)------------------------------
% 5.56/1.76  % (3473372)Success in time 0.709 s
% 5.56/1.76  % Vampire exiting
%------------------------------------------------------------------------------