↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n004.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 09:49:03 AM UTC 2026

% Result   : Unsatisfiable 3.67s 1.32s
% Output   : Refutation 5.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   54
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   86 (  16 unt;   3 def)
%            Number of atoms       :  262 (   4 equ)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :  355 ( 179   ~; 175   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   2 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   91 (   0 sgn  91   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X0,X1] :
      ( equalish(add(X0,add(X1,X2)),add(add(X0,X1),X2))
      | ~ defined(X0)
      | ~ defined(X1)
      | ~ defined(X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_addition) ).

fof(f2,axiom,
    ! [X0] :
      ( equalish(add(additive_identity,X0),X0)
      | ~ defined(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_of_identity_addition) ).

fof(f3,axiom,
    ! [X0] :
      ( equalish(add(X0,additive_inverse(X0)),additive_identity)
      | ~ defined(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_of_inverse_addition) ).

fof(f4,axiom,
    ! [X0,X1] :
      ( equalish(add(X0,X1),add(X1,X0))
      | ~ defined(X0)
      | ~ defined(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_addition) ).

fof(f10,axiom,
    ! [X0,X1] :
      ( defined(add(X0,X1))
      | ~ defined(X0)
      | ~ defined(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',well_definedness_of_addition) ).

fof(f12,axiom,
    ! [X0] :
      ( defined(additive_inverse(X0))
      | ~ defined(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',well_definedness_of_additive_inverse) ).

fof(f22,axiom,
    ! [X0,X1] :
      ( ~ equalish(X1,X0)
      | equalish(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_equality) ).

fof(f23,axiom,
    ! [X2,X0,X1] :
      ( ~ equalish(X2,X1)
      | ~ equalish(X0,X2)
      | equalish(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_equality) ).

fof(f24,axiom,
    ! [X2,X0,X1] :
      ( equalish(add(X0,X1),add(X2,X1))
      | ~ defined(X1)
      | ~ equalish(X0,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',compatibility_of_equality_and_addition) ).

fof(f28,axiom,
    defined(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).

fof(f29,axiom,
    defined(b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).

fof(f30,negated_conjecture,
    equalish(additive_identity,add(b,additive_inverse(a))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_identity_equals_add_3) ).

fof(f31,negated_conjecture,
    ~ equalish(a,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_not_equal_to_b_4) ).

fof(f32,definition,
    sF0 = additive_inverse(a),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f33,plain,
    additive_inverse(a) = sF0,
    inference(reorient_equations,[],[f32]) ).

fof(f34,definition,
    sF1 = add(b,sF0),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f35,plain,
    add(b,sF0) = sF1,
    inference(reorient_equations,[],[f34]) ).

fof(f36,plain,
    equalish(additive_identity,sF1),
    inference(definition_folding,[],[f30,f35,f33]) ).

fof(f37,plain,
    equalish(sF1,additive_identity),
    inference(resolution,[],[f22,f36]) ).

fof(f40,plain,
    ! [X0,X1] :
      ( ~ equalish(X0,add(additive_identity,X1))
      | equalish(X0,X1)
      | ~ defined(X1) ),
    inference(resolution,[],[f23,f2]) ).

fof(f52,definition,
    ( spl2_1
  <=> defined(sF0) ),
    introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).

fof(f53,plain,
    ( defined(sF0)
    | ~ spl2_1 ),
    inference(avatar_component_clause,[],[f52]) ).

fof(f54,plain,
    ( ~ defined(sF0)
    | spl2_1 ),
    inference(avatar_component_clause,[],[f52]) ).

fof(f63,plain,
    ( defined(sF0)
    | ~ defined(a) ),
    inference(superposition,[],[f12,f33]) ).

fof(f64,plain,
    ( ~ defined(a)
    | spl2_1 ),
    inference(forward_subsumption_resolution,[],[f63,f54]) ).

fof(f65,plain,
    ( $false
    | spl2_1 ),
    inference(forward_subsumption_resolution,[],[f64,f28]) ).

fof(f66,plain,
    spl2_1,
    inference(avatar_contradiction_clause,[],[f65]) ).

fof(f67,plain,
    ! [X0,X1] :
      ( equalish(add(X0,X1),X1)
      | ~ defined(X1)
      | ~ defined(X1)
      | ~ equalish(X0,additive_identity) ),
    inference(resolution,[],[f40,f24]) ).

fof(f69,plain,
    ! [X0,X1] :
      ( equalish(add(X0,X1),X1)
      | ~ defined(X1)
      | ~ equalish(X0,additive_identity) ),
    inference(duplicate_literal_removal,[],[f67]) ).

fof(f70,plain,
    ! [X2,X0,X1] :
      ( ~ equalish(X2,add(X1,X0))
      | ~ equalish(X1,additive_identity)
      | ~ defined(X0)
      | equalish(X2,X0) ),
    inference(resolution,[],[f69,f23]) ).

fof(f71,plain,
    ! [X0,X1] :
      ( equalish(X0,add(X1,X0))
      | ~ equalish(X1,additive_identity)
      | ~ defined(X0) ),
    inference(resolution,[],[f69,f22]) ).

fof(f198,plain,
    ! [X2,X3,X0,X1] :
      ( ~ equalish(X3,add(X0,add(X1,X2)))
      | ~ defined(X1)
      | ~ defined(X2)
      | ~ defined(X0)
      | equalish(X3,add(add(X0,X1),X2)) ),
    inference(resolution,[],[f1,f23]) ).

fof(f212,plain,
    ! [X2,X0,X1] :
      ( ~ defined(X0)
      | ~ defined(X1)
      | ~ defined(X2)
      | equalish(add(add(X0,X1),X2),add(add(X2,X0),X1))
      | ~ defined(add(X0,X1))
      | ~ defined(X2) ),
    inference(resolution,[],[f198,f4]) ).

fof(f219,plain,
    ! [X2,X0,X1] :
      ( ~ defined(X0)
      | ~ defined(X1)
      | ~ defined(X2)
      | equalish(add(add(X0,X1),X2),add(add(X2,X0),X1))
      | ~ defined(add(X0,X1)) ),
    inference(duplicate_literal_removal,[],[f212]) ).

fof(f222,plain,
    ! [X2,X0,X1] :
      ( equalish(add(add(X0,X1),X2),add(add(X2,X0),X1))
      | ~ defined(X1)
      | ~ defined(X2)
      | ~ defined(X0) ),
    inference(forward_subsumption_resolution,[],[f219,f10]) ).

fof(f235,plain,
    ! [X0] :
      ( equalish(add(add(sF0,X0),b),add(sF1,X0))
      | ~ defined(X0)
      | ~ defined(b)
      | ~ defined(sF0) ),
    inference(superposition,[],[f222,f35]) ).

fof(f239,plain,
    ! [X0] :
      ( equalish(add(add(sF0,X0),b),add(sF1,X0))
      | ~ defined(X0)
      | ~ defined(sF0) ),
    inference(forward_subsumption_resolution,[],[f235,f29]) ).

fof(f243,plain,
    ( ! [X0] :
        ( equalish(add(add(sF0,X0),b),add(sF1,X0))
        | ~ defined(X0) )
    | ~ spl2_1 ),
    inference(forward_subsumption_resolution,[],[f239,f53]) ).

fof(f248,plain,
    ( ! [X0] :
        ( ~ defined(X0)
        | ~ equalish(sF1,additive_identity)
        | ~ defined(X0)
        | equalish(add(add(sF0,X0),b),X0) )
    | ~ spl2_1 ),
    inference(resolution,[],[f243,f70]) ).

fof(f253,plain,
    ( ! [X0] :
        ( ~ defined(X0)
        | ~ equalish(sF1,additive_identity)
        | equalish(add(add(sF0,X0),b),X0) )
    | ~ spl2_1 ),
    inference(duplicate_literal_removal,[],[f248]) ).

fof(f257,plain,
    ( ! [X0] :
        ( equalish(add(add(sF0,X0),b),X0)
        | ~ defined(X0) )
    | ~ spl2_1 ),
    inference(forward_subsumption_resolution,[],[f253,f37]) ).

fof(f261,plain,
    ( ! [X0,X1] :
        ( ~ equalish(X1,add(add(sF0,X0),b))
        | ~ defined(X0)
        | equalish(X1,X0) )
    | ~ spl2_1 ),
    inference(resolution,[],[f257,f23]) ).

fof(f270,plain,
    ( ! [X0,X1] :
        ( ~ defined(X0)
        | equalish(add(X1,b),X0)
        | ~ defined(b)
        | ~ equalish(X1,add(sF0,X0)) )
    | ~ spl2_1 ),
    inference(resolution,[],[f261,f24]) ).

fof(f284,plain,
    ( ! [X0,X1] :
        ( ~ equalish(X1,add(sF0,X0))
        | equalish(add(X1,b),X0)
        | ~ defined(X0) )
    | ~ spl2_1 ),
    inference(forward_subsumption_resolution,[],[f270,f29]) ).

fof(f290,plain,
    ( ! [X0] :
        ( equalish(add(add(X0,sF0),b),X0)
        | ~ defined(X0)
        | ~ defined(X0)
        | ~ defined(sF0) )
    | ~ spl2_1 ),
    inference(resolution,[],[f284,f4]) ).

fof(f297,plain,
    ( ! [X0] :
        ( equalish(add(add(X0,sF0),b),X0)
        | ~ defined(X0)
        | ~ defined(sF0) )
    | ~ spl2_1 ),
    inference(duplicate_literal_removal,[],[f290]) ).

fof(f301,plain,
    ( ! [X0] :
        ( equalish(add(add(X0,sF0),b),X0)
        | ~ defined(X0) )
    | ~ spl2_1 ),
    inference(forward_subsumption_resolution,[],[f297,f53]) ).

fof(f314,plain,
    ( ! [X0,X1] :
        ( ~ equalish(X1,add(add(X0,sF0),b))
        | ~ defined(X0)
        | equalish(X1,X0) )
    | ~ spl2_1 ),
    inference(resolution,[],[f301,f23]) ).

fof(f337,plain,
    ( ! [X0] :
        ( ~ equalish(X0,add(sF1,b))
        | ~ defined(b)
        | equalish(X0,b) )
    | ~ spl2_1 ),
    inference(superposition,[],[f314,f35]) ).

fof(f340,plain,
    ( ! [X0] :
        ( ~ equalish(X0,add(sF1,b))
        | equalish(X0,b) )
    | ~ spl2_1 ),
    inference(forward_subsumption_resolution,[],[f337,f29]) ).

fof(f361,plain,
    ( ! [X0] :
        ( equalish(add(X0,b),b)
        | ~ defined(b)
        | ~ equalish(X0,sF1) )
    | ~ spl2_1 ),
    inference(resolution,[],[f340,f24]) ).

fof(f414,plain,
    ( ! [X0] :
        ( equalish(add(X0,b),b)
        | ~ equalish(X0,sF1) )
    | ~ spl2_1 ),
    inference(forward_subsumption_resolution,[],[f361,f29]) ).

fof(f512,plain,
    ( ! [X0,X1] :
        ( ~ equalish(X1,add(X0,b))
        | ~ equalish(X0,sF1)
        | equalish(X1,b) )
    | ~ spl2_1 ),
    inference(resolution,[],[f414,f23]) ).

fof(f515,plain,
    ( ! [X0,X1] :
        ( ~ equalish(X0,sF1)
        | equalish(add(X1,b),b)
        | ~ defined(b)
        | ~ equalish(X1,X0) )
    | ~ spl2_1 ),
    inference(resolution,[],[f512,f24]) ).

fof(f537,plain,
    ( ! [X0,X1] :
        ( ~ equalish(X1,X0)
        | equalish(add(X1,b),b)
        | ~ equalish(X0,sF1) )
    | ~ spl2_1 ),
    inference(forward_subsumption_resolution,[],[f515,f29]) ).

fof(f591,plain,
    ( ! [X0] :
        ( equalish(add(add(X0,additive_inverse(X0)),b),b)
        | ~ equalish(additive_identity,sF1)
        | ~ defined(X0) )
    | ~ spl2_1 ),
    inference(resolution,[],[f537,f3]) ).

fof(f618,plain,
    ( ! [X0] :
        ( equalish(add(add(X0,additive_inverse(X0)),b),b)
        | ~ defined(X0) )
    | ~ spl2_1 ),
    inference(forward_subsumption_resolution,[],[f591,f36]) ).

fof(f621,plain,
    ( ! [X0,X1] :
        ( ~ equalish(X1,add(add(X0,additive_inverse(X0)),b))
        | ~ defined(X0)
        | equalish(X1,b) )
    | ~ spl2_1 ),
    inference(resolution,[],[f618,f23]) ).

fof(f626,plain,
    ( ! [X0,X1] :
        ( ~ defined(X0)
        | equalish(add(X1,b),b)
        | ~ defined(b)
        | ~ equalish(X1,add(X0,additive_inverse(X0))) )
    | ~ spl2_1 ),
    inference(resolution,[],[f621,f24]) ).

fof(f646,plain,
    ( ! [X0,X1] :
        ( ~ equalish(X1,add(X0,additive_inverse(X0)))
        | equalish(add(X1,b),b)
        | ~ defined(X0) )
    | ~ spl2_1 ),
    inference(forward_subsumption_resolution,[],[f626,f29]) ).

fof(f770,plain,
    ( ! [X0] :
        ( equalish(add(add(additive_inverse(X0),X0),b),b)
        | ~ defined(X0)
        | ~ defined(additive_inverse(X0))
        | ~ defined(X0) )
    | ~ spl2_1 ),
    inference(resolution,[],[f646,f4]) ).

fof(f784,plain,
    ( ! [X0] :
        ( equalish(add(add(additive_inverse(X0),X0),b),b)
        | ~ defined(X0)
        | ~ defined(additive_inverse(X0)) )
    | ~ spl2_1 ),
    inference(duplicate_literal_removal,[],[f770]) ).

fof(f789,plain,
    ( ! [X0] :
        ( equalish(add(add(additive_inverse(X0),X0),b),b)
        | ~ defined(X0) )
    | ~ spl2_1 ),
    inference(forward_subsumption_resolution,[],[f784,f12]) ).

fof(f803,plain,
    ( ! [X0,X1] :
        ( ~ equalish(X1,add(add(additive_inverse(X0),X0),b))
        | ~ defined(X0)
        | equalish(X1,b) )
    | ~ spl2_1 ),
    inference(resolution,[],[f789,f23]) ).

fof(f811,plain,
    ( ! [X0] :
        ( ~ defined(X0)
        | equalish(add(add(X0,b),additive_inverse(X0)),b)
        | ~ defined(b)
        | ~ defined(additive_inverse(X0))
        | ~ defined(X0) )
    | ~ spl2_1 ),
    inference(resolution,[],[f803,f222]) ).

fof(f822,plain,
    ( ! [X0] :
        ( ~ defined(X0)
        | equalish(add(add(X0,b),additive_inverse(X0)),b)
        | ~ defined(b)
        | ~ defined(additive_inverse(X0)) )
    | ~ spl2_1 ),
    inference(duplicate_literal_removal,[],[f811]) ).

fof(f825,plain,
    ( ! [X0] :
        ( ~ defined(X0)
        | equalish(add(add(X0,b),additive_inverse(X0)),b)
        | ~ defined(additive_inverse(X0)) )
    | ~ spl2_1 ),
    inference(forward_subsumption_resolution,[],[f822,f29]) ).

fof(f829,plain,
    ( ! [X0] :
        ( equalish(add(add(X0,b),additive_inverse(X0)),b)
        | ~ defined(X0) )
    | ~ spl2_1 ),
    inference(forward_subsumption_resolution,[],[f825,f12]) ).

fof(f837,plain,
    ( ! [X0,X1] :
        ( ~ equalish(X1,add(add(X0,b),additive_inverse(X0)))
        | ~ defined(X0)
        | equalish(X1,b) )
    | ~ spl2_1 ),
    inference(resolution,[],[f829,f23]) ).

fof(f855,plain,
    ( ! [X0] :
        ( ~ equalish(X0,add(add(a,b),sF0))
        | ~ defined(a)
        | equalish(X0,b) )
    | ~ spl2_1 ),
    inference(superposition,[],[f837,f33]) ).

fof(f858,plain,
    ( ! [X0] :
        ( ~ equalish(X0,add(add(a,b),sF0))
        | equalish(X0,b) )
    | ~ spl2_1 ),
    inference(forward_subsumption_resolution,[],[f855,f28]) ).

fof(f996,plain,
    ( equalish(add(add(b,sF0),a),b)
    | ~ defined(sF0)
    | ~ defined(a)
    | ~ defined(b)
    | ~ spl2_1 ),
    inference(resolution,[],[f858,f222]) ).

fof(f1052,plain,
    ( equalish(add(add(b,sF0),a),b)
    | ~ defined(a)
    | ~ defined(b)
    | ~ spl2_1 ),
    inference(forward_subsumption_resolution,[],[f996,f53]) ).

fof(f1056,plain,
    ( equalish(add(add(b,sF0),a),b)
    | ~ defined(b)
    | ~ spl2_1 ),
    inference(forward_subsumption_resolution,[],[f1052,f28]) ).

fof(f1076,plain,
    ( equalish(add(add(b,sF0),a),b)
    | ~ spl2_1 ),
    inference(forward_subsumption_resolution,[],[f1056,f29]) ).

fof(f1078,plain,
    ( equalish(add(sF1,a),b)
    | ~ spl2_1 ),
    inference(forward_demodulation,[],[f1076,f35]) ).

fof(f1082,plain,
    ( ! [X0] :
        ( ~ equalish(X0,add(sF1,a))
        | equalish(X0,b) )
    | ~ spl2_1 ),
    inference(resolution,[],[f1078,f23]) ).

fof(f1084,plain,
    ( equalish(a,b)
    | ~ equalish(sF1,additive_identity)
    | ~ defined(a)
    | ~ spl2_1 ),
    inference(resolution,[],[f1082,f71]) ).

fof(f1144,plain,
    ( ~ equalish(sF1,additive_identity)
    | ~ defined(a)
    | ~ spl2_1 ),
    inference(forward_subsumption_resolution,[],[f1084,f31]) ).

fof(f1145,plain,
    ( ~ defined(a)
    | ~ spl2_1 ),
    inference(forward_subsumption_resolution,[],[f1144,f37]) ).

fof(f1146,plain,
    ( $false
    | ~ spl2_1 ),
    inference(forward_subsumption_resolution,[],[f1145,f28]) ).

fof(f1147,plain,
    ~ spl2_1,
    inference(avatar_contradiction_clause,[],[f1146]) ).

cnf(s3,plain,
    spl2_1,
    inference(sat_conversion,[],[f66]) ).

cnf(s68,plain,
    ~ spl2_1,
    inference(sat_conversion,[],[f1147]) ).

cnf(s69,plain,
    $false,
    inference(rat,[],[s3,s68]) ).

fof(f1148,plain,
    $false,
    inference(avatar_sat_refutation,[],[s69]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : FLD024-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.16  % Computer : n004.cluster.edu
% 0.10/0.16  % Model    : x86_64 x86_64
% 0.10/0.16  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16  % Memory   : 8046.5625MB
% 0.10/0.16  % OS       : Linux 6.8.0-71-generic
% 0.10/0.16  % CPULimit : 300
% 0.10/0.16  % WCLimit  : 300
% 0.10/0.16  % DateTime : Tue Sep 29 00:28:07 UTC 2026
% 0.10/0.16  % CPUTime  : 
% 0.10/0.16  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.20  Running first-order theorem proving
% 0.10/0.20  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
% 3.67/1.32  % (947681)Input is clausal, will run a generic CNF schedule.
% 3.67/1.32  % (947686)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=2468938548:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.67/1.32  % (947692)dis-21_1_sil=8000:lcm=predicate:random_seed=2122585301: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)
% 3.67/1.32  % (947689)lrs+10_1_sil=8000:sp=occurrence:random_seed=292378945:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.67/1.32  % (947687)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=4021393497:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.67/1.32  % (947691)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3036433906:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.67/1.32  % (947688)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=243637971:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.67/1.32  % (947690)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3692972306:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.67/1.32  % (947690)Instruction limit reached! 
% 3.67/1.32  % (947690)------------------------------
% 3.67/1.32  % (947690)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.67/1.32  % (947690)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.67/1.32  % (947690)CaDiCaL version: 2.1.3
% 3.67/1.32  % (947690)Termination reason: Instruction limit
% 3.67/1.32  % (947690)Termination phase: Saturation
% 3.67/1.32  % (947690)Time elapsed: 0.066 s
% 3.67/1.32  % (947690)Peak memory usage: 88 MB
% 3.67/1.32  % (947690)Instructions burned: 115 (million)
% 3.67/1.32  % (947689)Instruction limit reached! 
% 3.67/1.32  % (947689)------------------------------
% 3.67/1.32  % (947689)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.67/1.32  % (947689)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.67/1.32  % (947689)CaDiCaL version: 2.1.3
% 3.67/1.32  % (947689)Termination reason: Instruction limit
% 3.67/1.32  % (947689)Termination phase: Saturation
% 3.67/1.32  % (947689)Time elapsed: 0.069 s
% 3.67/1.32  % (947689)Peak memory usage: 89 MB
% 3.67/1.32  % (947689)Instructions burned: 108 (million)
% 3.67/1.32  % (947692)Instruction limit reached! 
% 3.67/1.32  % (947692)------------------------------
% 3.67/1.32  % (947692)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.67/1.32  % (947692)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.67/1.32  % (947692)CaDiCaL version: 2.1.3
% 3.67/1.32  % (947692)Termination reason: Instruction limit
% 3.67/1.32  % (947692)Termination phase: Saturation
% 3.67/1.32  % (947692)Time elapsed: 0.075 s
% 3.67/1.32  % (947692)Peak memory usage: 89 MB
% 3.67/1.32  % (947692)Instructions burned: 118 (million)
% 3.67/1.32  % (947691)Instruction limit reached! 
% 3.67/1.32  % (947691)------------------------------
% 3.67/1.32  % (947691)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.67/1.32  % (947691)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.67/1.32  % (947691)CaDiCaL version: 2.1.3
% 3.67/1.32  % (947691)Termination reason: Instruction limit
% 3.67/1.32  % (947691)Termination phase: Saturation
% 3.67/1.32  % (947691)Time elapsed: 0.123 s
% 3.67/1.32  % (947691)Peak memory usage: 89 MB
% 3.67/1.32  % (947691)Instructions burned: 180 (million)
% 3.67/1.32  % (947701)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=1318495718: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)
% 3.67/1.32  % (947702)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=2523280698:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 3.67/1.32  % (947700)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=3101268096:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 3.67/1.32  % (947703)lrs+10_64_to=lpo:sil=8000:random_seed=560550547:i=126:bd=preordered_2997 on theBenchmark for (2997ds/126Mi)
% 3.67/1.32  % (947700)Instruction limit reached! 
% 3.67/1.32  % (947700)------------------------------
% 3.67/1.32  % (947700)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.67/1.32  % (947700)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.67/1.32  % (947700)CaDiCaL version: 2.1.3
% 3.67/1.32  % (947700)Termination reason: Instruction limit
% 3.67/1.32  % (947700)Termination phase: Saturation
% 3.67/1.32  % (947700)Time elapsed: 0.079 s
% 3.67/1.32  % (947700)Peak memory usage: 89 MB
% 3.67/1.32  % (947700)Instructions burned: 144 (million)
% 3.67/1.32  % (947701)Instruction limit reached! 
% 3.67/1.32  % (947701)------------------------------
% 3.67/1.32  % (947701)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.67/1.32  % (947701)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.67/1.32  % (947701)CaDiCaL version: 2.1.3
% 3.67/1.32  % (947701)Termination reason: Instruction limit
% 3.67/1.32  % (947701)Termination phase: Saturation
% 3.67/1.32  % (947701)Time elapsed: 0.096 s
% 3.67/1.32  % (947701)Peak memory usage: 94 MB
% 3.67/1.32  % (947701)Instructions burned: 191 (million)
% 3.67/1.32  % (947702)Instruction limit reached! 
% 3.67/1.32  % (947702)------------------------------
% 3.67/1.32  % (947702)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.67/1.32  % (947702)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.67/1.32  % (947702)CaDiCaL version: 2.1.3
% 3.67/1.32  % (947702)Termination reason: Instruction limit
% 3.67/1.32  % (947702)Termination phase: Saturation
% 3.67/1.32  % (947702)Time elapsed: 0.134 s
% 3.67/1.32  % (947702)Peak memory usage: 89 MB
% 3.67/1.32  % (947702)Instructions burned: 220 (million)
% 3.67/1.32  % (947703)Instruction limit reached! 
% 3.67/1.32  % (947703)------------------------------
% 3.67/1.32  % (947703)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.67/1.32  % (947703)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.67/1.32  % (947703)CaDiCaL version: 2.1.3
% 3.67/1.32  % (947703)Termination reason: Instruction limit
% 3.67/1.32  % (947703)Termination phase: Saturation
% 3.67/1.32  % (947703)Time elapsed: 0.073 s
% 3.67/1.32  % (947703)Peak memory usage: 90 MB
% 3.67/1.32  % (947703)Instructions burned: 126 (million)
% 3.67/1.32  % (947686)First to succeed.
% 3.67/1.32  % (947686)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-947681"
% 3.67/1.32  % (947708)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=3399517493:avsq=on:i=194:fgj=on:bd=preordered_2995 on theBenchmark for (2995ds/194Mi)
% 3.67/1.32  % (947709)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=269443655:i=157:gtg=all_2995 on theBenchmark for (2995ds/157Mi)
% 3.67/1.32  % (947710)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=220899441:i=3394:sd=4:ss=included:sgt=64_2995 on theBenchmark for (2995ds/3394Mi)
% 3.67/1.32  % (947711)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=2766139343:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2995 on theBenchmark for (2995ds/106Mi)
% 3.67/1.32  % (947711)Instruction limit reached! 
% 3.67/1.32  % (947711)------------------------------
% 3.67/1.32  % (947711)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.67/1.32  % (947711)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.67/1.32  % (947711)CaDiCaL version: 2.1.3
% 3.67/1.32  % (947711)Termination reason: Instruction limit
% 3.67/1.32  % (947711)Termination phase: Saturation
% 3.67/1.32  % (947711)Time elapsed: 0.053 s
% 3.67/1.32  % (947711)Peak memory usage: 89 MB
% 3.67/1.32  % (947711)Instructions burned: 106 (million)
% 3.67/1.32  % (947708)Instruction limit reached! 
% 3.67/1.32  % (947708)------------------------------
% 3.67/1.32  % (947708)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.67/1.32  % (947708)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.67/1.32  % (947708)CaDiCaL version: 2.1.3
% 3.67/1.32  % (947708)Termination reason: Instruction limit
% 3.67/1.32  % (947708)Termination phase: Saturation
% 3.67/1.32  % (947708)Time elapsed: 0.134 s
% 3.67/1.32  % (947708)Peak memory usage: 89 MB
% 3.67/1.32  % (947708)Instructions burned: 195 (million)
% 3.67/1.32  % (947686)Refutation found. Thanks to Tanya!
% 3.67/1.32  % SZS status Unsatisfiable for theBenchmark
% 3.67/1.32  % SZS output start Proof for theBenchmark
% See solution above
% 5.45/1.52  % (947686)------------------------------
% 5.45/1.52  % (947686)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.45/1.52  % (947686)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.45/1.52  % (947686)CaDiCaL version: 2.1.3
% 5.45/1.52  % (947686)Termination reason: Refutation
% 5.45/1.52  % (947686)Time elapsed: 0.407 s
% 5.45/1.52  % (947686)Peak memory usage: 131 MB
% 5.45/1.52  % (947686)Instructions burned: 1122 (million)
% 5.45/1.52  % (947686)------------------------------
% 5.45/1.52  % (947686)------------------------------
% 5.45/1.52  % (947681)Success in time 0.683 s
% 5.45/1.52  % Vampire exiting
%------------------------------------------------------------------------------