↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL080-2 : 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 : n001.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 11:51:08 AM UTC 2026

% Result   : Unsatisfiable 8.57s 2.10s
% Output   : Refutation 9.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   23
% Syntax   : Number of formulae    :   97 (  39 unt;  17 def)
%            Number of atoms       :  195 (  24 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  188 (  90   ~;  87   |;   0   &)
%                                         (  11 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :   14 (  12 usr;  12 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;  10 con; 0-2 aty)
%            Number of variables   :   38 (   0 sgn  38   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(X0,X1))
      | ~ is_a_theorem(X0)
      | is_a_theorem(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

fof(f2,axiom,
    ! [X0] : is_a_theorem(implies(X0,X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ic_1) ).

fof(f3,axiom,
    ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ic_2) ).

fof(f4,axiom,
    ! [X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X0),X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ic_3) ).

fof(f5,axiom,
    ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ic_4) ).

fof(f6,negated_conjecture,
    ~ is_a_theorem(implies(implies(implies(a,b),c),implies(implies(c,a),implies(e,a)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ic_JLukasiewicz) ).

fof(f7,definition,
    sF0 = implies(a,b),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f8,plain,
    implies(a,b) = sF0,
    inference(reorient_equations,[],[f7]) ).

fof(f9,definition,
    sF1 = implies(sF0,c),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f10,plain,
    implies(sF0,c) = sF1,
    inference(reorient_equations,[],[f9]) ).

fof(f11,definition,
    sF2 = implies(c,a),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f12,plain,
    implies(c,a) = sF2,
    inference(reorient_equations,[],[f11]) ).

fof(f13,definition,
    sF3 = implies(e,a),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f14,plain,
    implies(e,a) = sF3,
    inference(reorient_equations,[],[f13]) ).

fof(f15,definition,
    sF4 = implies(sF2,sF3),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f16,plain,
    implies(sF2,sF3) = sF4,
    inference(reorient_equations,[],[f15]) ).

fof(f17,definition,
    sF5 = implies(sF1,sF4),
    introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).

fof(f18,plain,
    implies(sF1,sF4) = sF5,
    inference(reorient_equations,[],[f17]) ).

fof(f19,plain,
    ~ is_a_theorem(sF5),
    inference(definition_folding,[],[f6,f18,f16,f14,f12,f10,f8]) ).

fof(f21,definition,
    ( spl6_1
  <=> is_a_theorem(sF5) ),
    introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).

fof(f23,plain,
    ( ~ is_a_theorem(sF5)
    | spl6_1 ),
    inference(avatar_component_clause,[],[f21]) ).

fof(f24,plain,
    ~ spl6_1,
    inference(avatar_split_clause,[],[f19,f21]) ).

fof(f26,definition,
    ( spl6_2
  <=> implies(a,b) = sF0 ),
    introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).

fof(f28,plain,
    ( implies(a,b) = sF0
    | ~ spl6_2 ),
    inference(avatar_component_clause,[],[f26]) ).

fof(f29,plain,
    spl6_2,
    inference(avatar_split_clause,[],[f8,f26]) ).

fof(f31,definition,
    ( spl6_3
  <=> implies(sF0,c) = sF1 ),
    introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).

fof(f33,plain,
    ( implies(sF0,c) = sF1
    | ~ spl6_3 ),
    inference(avatar_component_clause,[],[f31]) ).

fof(f34,plain,
    spl6_3,
    inference(avatar_split_clause,[],[f10,f31]) ).

fof(f36,definition,
    ( spl6_4
  <=> implies(c,a) = sF2 ),
    introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition]) ).

fof(f38,plain,
    ( implies(c,a) = sF2
    | ~ spl6_4 ),
    inference(avatar_component_clause,[],[f36]) ).

fof(f39,plain,
    spl6_4,
    inference(avatar_split_clause,[],[f12,f36]) ).

fof(f41,definition,
    ( spl6_5
  <=> implies(e,a) = sF3 ),
    introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition]) ).

fof(f43,plain,
    ( implies(e,a) = sF3
    | ~ spl6_5 ),
    inference(avatar_component_clause,[],[f41]) ).

fof(f44,plain,
    spl6_5,
    inference(avatar_split_clause,[],[f14,f41]) ).

fof(f46,definition,
    ( spl6_6
  <=> implies(sF2,sF3) = sF4 ),
    introduced(definition,[new_symbols(definition,[spl6_6])],[avatar_definition]) ).

fof(f48,plain,
    ( implies(sF2,sF3) = sF4
    | ~ spl6_6 ),
    inference(avatar_component_clause,[],[f46]) ).

fof(f49,plain,
    spl6_6,
    inference(avatar_split_clause,[],[f16,f46]) ).

fof(f51,definition,
    ( spl6_7
  <=> implies(sF1,sF4) = sF5 ),
    introduced(definition,[new_symbols(definition,[spl6_7])],[avatar_definition]) ).

fof(f53,plain,
    ( implies(sF1,sF4) = sF5
    | ~ spl6_7 ),
    inference(avatar_component_clause,[],[f51]) ).

fof(f54,plain,
    spl6_7,
    inference(avatar_split_clause,[],[f18,f51]) ).

fof(f57,plain,
    ( is_a_theorem(implies(a,sF3))
    | ~ spl6_5 ),
    inference(superposition,[],[f3,f43]) ).

fof(f77,definition,
    ( spl6_11
  <=> is_a_theorem(implies(a,sF3)) ),
    introduced(definition,[new_symbols(definition,[spl6_11])],[avatar_definition]) ).

fof(f79,plain,
    ( is_a_theorem(implies(a,sF3))
    | ~ spl6_11 ),
    inference(avatar_component_clause,[],[f77]) ).

fof(f80,plain,
    ( spl6_11
    | ~ spl6_5 ),
    inference(avatar_split_clause,[],[f57,f41,f77]) ).

fof(f92,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(X1,X0))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f1,f3]) ).

fof(f140,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(implies(X0,X1),X0))
      | is_a_theorem(X0) ),
    inference(resolution,[],[f4,f1]) ).

fof(f141,plain,
    ( is_a_theorem(implies(implies(sF0,a),a))
    | ~ spl6_2 ),
    inference(superposition,[],[f4,f28]) ).

fof(f173,definition,
    ( spl6_28
  <=> is_a_theorem(implies(implies(sF0,a),a)) ),
    introduced(definition,[new_symbols(definition,[spl6_28])],[avatar_definition]) ).

fof(f175,plain,
    ( is_a_theorem(implies(implies(sF0,a),a))
    | ~ spl6_28 ),
    inference(avatar_component_clause,[],[f173]) ).

fof(f176,plain,
    ( spl6_28
    | ~ spl6_2 ),
    inference(avatar_split_clause,[],[f141,f26,f173]) ).

fof(f177,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(implies(X1,X2),implies(X0,X2)))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[],[f5,f1]) ).

fof(f181,plain,
    ( ! [X0] : is_a_theorem(implies(sF1,implies(implies(c,X0),implies(sF0,X0))))
    | ~ spl6_3 ),
    inference(superposition,[],[f5,f33]) ).

fof(f194,plain,
    ( ! [X0] : is_a_theorem(implies(implies(sF1,X0),implies(implies(X0,sF4),sF5)))
    | ~ spl6_7 ),
    inference(superposition,[],[f5,f53]) ).

fof(f195,plain,
    ( ! [X0] : is_a_theorem(implies(implies(sF2,X0),implies(implies(X0,sF3),sF4)))
    | ~ spl6_6 ),
    inference(superposition,[],[f5,f48]) ).

fof(f292,plain,
    ( is_a_theorem(implies(sF1,implies(sF2,implies(sF0,a))))
    | ~ spl6_3
    | ~ spl6_4 ),
    inference(superposition,[],[f181,f38]) ).

fof(f295,definition,
    ( spl6_37
  <=> is_a_theorem(implies(sF1,implies(sF2,implies(sF0,a)))) ),
    introduced(definition,[new_symbols(definition,[spl6_37])],[avatar_definition]) ).

fof(f297,plain,
    ( is_a_theorem(implies(sF1,implies(sF2,implies(sF0,a))))
    | ~ spl6_37 ),
    inference(avatar_component_clause,[],[f295]) ).

fof(f298,plain,
    ( spl6_37
    | ~ spl6_3
    | ~ spl6_4 ),
    inference(avatar_split_clause,[],[f292,f36,f31,f295]) ).

fof(f402,plain,
    ( ! [X0] :
        ( is_a_theorem(implies(implies(X0,sF4),sF5))
        | ~ is_a_theorem(implies(sF1,X0)) )
    | ~ spl6_7 ),
    inference(resolution,[],[f194,f1]) ).

fof(f411,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(X0,implies(X0,X1)))
      | is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[],[f177,f140]) ).

fof(f412,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X1,X2))
      | ~ is_a_theorem(implies(X0,X1))
      | is_a_theorem(implies(X0,X2)) ),
    inference(resolution,[],[f177,f1]) ).

fof(f484,plain,
    ( ! [X0] :
        ( ~ is_a_theorem(implies(sF1,X0))
        | ~ is_a_theorem(implies(X0,sF4))
        | is_a_theorem(sF5) )
    | ~ spl6_7 ),
    inference(resolution,[],[f402,f1]) ).

fof(f486,plain,
    ( ! [X0] :
        ( ~ is_a_theorem(implies(sF1,X0))
        | ~ is_a_theorem(implies(X0,sF4)) )
    | spl6_1
    | ~ spl6_7 ),
    inference(forward_subsumption_resolution,[],[f484,f23]) ).

fof(f519,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(implies(X0,X1),X0))
      | is_a_theorem(implies(implies(X0,X1),X1)) ),
    inference(resolution,[],[f411,f177]) ).

fof(f556,plain,
    ( ! [X0,X1] :
        ( is_a_theorem(implies(X0,implies(implies(X1,sF3),sF4)))
        | ~ is_a_theorem(implies(X0,implies(sF2,X1))) )
    | ~ spl6_6 ),
    inference(resolution,[],[f412,f195]) ).

fof(f572,plain,
    ( ! [X0] :
        ( ~ is_a_theorem(implies(X0,a))
        | is_a_theorem(implies(X0,sF3)) )
    | ~ spl6_11 ),
    inference(resolution,[],[f412,f79]) ).

fof(f579,plain,
    ( ! [X0] :
        ( is_a_theorem(implies(X0,implies(sF2,implies(sF0,a))))
        | ~ is_a_theorem(implies(X0,sF1)) )
    | ~ spl6_37 ),
    inference(resolution,[],[f412,f297]) ).

fof(f680,plain,
    ( is_a_theorem(implies(implies(sF0,a),sF3))
    | ~ spl6_11
    | ~ spl6_28 ),
    inference(resolution,[],[f572,f175]) ).

fof(f685,definition,
    ( spl6_61
  <=> is_a_theorem(implies(implies(sF0,a),sF3)) ),
    introduced(definition,[new_symbols(definition,[spl6_61])],[avatar_definition]) ).

fof(f687,plain,
    ( is_a_theorem(implies(implies(sF0,a),sF3))
    | ~ spl6_61 ),
    inference(avatar_component_clause,[],[f685]) ).

fof(f688,plain,
    ( spl6_61
    | ~ spl6_11
    | ~ spl6_28 ),
    inference(avatar_split_clause,[],[f680,f173,f77,f685]) ).

fof(f916,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(implies(X0,X1),X1))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f519,f92]) ).

fof(f1556,plain,
    ( ! [X0] :
        ( ~ is_a_theorem(implies(implies(implies(X0,sF3),sF4),sF4))
        | ~ is_a_theorem(implies(sF1,implies(sF2,X0))) )
    | spl6_1
    | ~ spl6_6
    | ~ spl6_7 ),
    inference(resolution,[],[f556,f486]) ).

fof(f3309,plain,
    ( ! [X0] :
        ( ~ is_a_theorem(implies(sF1,implies(sF2,X0)))
        | ~ is_a_theorem(implies(X0,sF3)) )
    | spl6_1
    | ~ spl6_6
    | ~ spl6_7 ),
    inference(resolution,[],[f916,f1556]) ).

fof(f3369,plain,
    ( ~ is_a_theorem(implies(implies(sF0,a),sF3))
    | ~ is_a_theorem(implies(sF1,sF1))
    | spl6_1
    | ~ spl6_6
    | ~ spl6_7
    | ~ spl6_37 ),
    inference(resolution,[],[f3309,f579]) ).

fof(f3385,plain,
    ( ~ is_a_theorem(implies(sF1,sF1))
    | spl6_1
    | ~ spl6_6
    | ~ spl6_7
    | ~ spl6_37
    | ~ spl6_61 ),
    inference(forward_subsumption_resolution,[],[f3369,f687]) ).

fof(f3390,plain,
    ( $false
    | spl6_1
    | ~ spl6_6
    | ~ spl6_7
    | ~ spl6_37
    | ~ spl6_61 ),
    inference(forward_subsumption_resolution,[],[f3385,f2]) ).

fof(f3391,plain,
    ( spl6_1
    | ~ spl6_6
    | ~ spl6_7
    | ~ spl6_37
    | ~ spl6_61 ),
    inference(avatar_contradiction_clause,[],[f3390]) ).

cnf(s1,plain,
    ~ spl6_1,
    inference(sat_conversion,[],[f24]) ).

cnf(s2,plain,
    spl6_2,
    inference(sat_conversion,[],[f29]) ).

cnf(s3,plain,
    spl6_3,
    inference(sat_conversion,[],[f34]) ).

cnf(s4,plain,
    spl6_4,
    inference(sat_conversion,[],[f39]) ).

cnf(s5,plain,
    spl6_5,
    inference(sat_conversion,[],[f44]) ).

cnf(s6,plain,
    spl6_6,
    inference(sat_conversion,[],[f49]) ).

cnf(s7,plain,
    spl6_7,
    inference(sat_conversion,[],[f54]) ).

cnf(s11,plain,
    ( ~ spl6_5
    | spl6_11 ),
    inference(sat_conversion,[],[f80]) ).

cnf(s24,plain,
    ( ~ spl6_2
    | spl6_28 ),
    inference(sat_conversion,[],[f176]) ).

cnf(s39,plain,
    ( ~ spl6_3
    | ~ spl6_4
    | spl6_37 ),
    inference(sat_conversion,[],[f298]) ).

cnf(s62,plain,
    ( ~ spl6_11
    | ~ spl6_28
    | spl6_61 ),
    inference(sat_conversion,[],[f688]) ).

cnf(s268,plain,
    ( spl6_1
    | ~ spl6_6
    | ~ spl6_7
    | ~ spl6_37
    | ~ spl6_61 ),
    inference(sat_conversion,[],[f3391]) ).

cnf(s288,plain,
    spl6_11,
    inference(rat,[],[s11,s5]) ).

cnf(s308,plain,
    spl6_37,
    inference(rat,[],[s39,s4,s3]) ).

cnf(s321,plain,
    spl6_28,
    inference(rat,[],[s24,s2]) ).

cnf(s326,plain,
    spl6_61,
    inference(rat,[],[s62,s288,s321]) ).

cnf(s328,plain,
    spl6_1,
    inference(rat,[],[s268,s308,s6,s7,s326]) ).

cnf(s329,plain,
    $false,
    inference(rat,[],[s1,s328]) ).

fof(f3393,plain,
    $false,
    inference(avatar_sat_refutation,[],[s329]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL080-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37  % Computer : n001.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep 27 15:26:46 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41  Running first-order theorem proving
% 0.11/0.41  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
% 8.57/2.10  % (3703817)Input is clausal, will run a generic CNF schedule.
% 8.57/2.10  % (3703889)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3561032132:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 8.57/2.10  % (3703891)lrs+10_1_sil=8000:sp=occurrence:random_seed=2646901233:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 8.57/2.10  % (3703890)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1597488834:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 8.57/2.10  % (3703888)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=121632461:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 8.57/2.10  % (3703894)dis-21_1_sil=8000:lcm=predicate:random_seed=1028066797: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)
% 8.57/2.10  % (3703893)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=760022272:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 8.57/2.10  % (3703892)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3398742475:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 8.57/2.10  % (3703891)Instruction limit reached! 
% 8.57/2.10  % (3703891)------------------------------
% 8.57/2.10  % (3703891)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.57/2.10  % (3703891)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.57/2.10  % (3703891)CaDiCaL version: 2.1.3
% 8.57/2.10  % (3703891)Termination reason: Instruction limit
% 8.57/2.10  % (3703891)Termination phase: Saturation
% 8.57/2.10  % (3703891)Time elapsed: 0.068 s
% 8.57/2.10  % (3703891)Peak memory usage: 88 MB
% 8.57/2.10  % (3703891)Instructions burned: 107 (million)
% 8.57/2.10  % (3703892)Instruction limit reached! 
% 8.57/2.10  % (3703892)------------------------------
% 8.57/2.10  % (3703892)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.57/2.10  % (3703892)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.57/2.10  % (3703892)CaDiCaL version: 2.1.3
% 8.57/2.10  % (3703892)Termination reason: Instruction limit
% 8.57/2.10  % (3703892)Termination phase: Saturation
% 8.57/2.10  % (3703892)Time elapsed: 0.068 s
% 8.57/2.10  % (3703892)Peak memory usage: 88 MB
% 8.57/2.10  % (3703892)Instructions burned: 114 (million)
% 8.57/2.10  % (3703894)Instruction limit reached! 
% 8.57/2.10  % (3703894)------------------------------
% 8.57/2.10  % (3703894)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.57/2.10  % (3703894)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.57/2.10  % (3703894)CaDiCaL version: 2.1.3
% 8.57/2.10  % (3703894)Termination reason: Instruction limit
% 8.57/2.10  % (3703894)Termination phase: Saturation
% 8.57/2.10  % (3703894)Time elapsed: 0.079 s
% 8.57/2.10  % (3703894)Peak memory usage: 88 MB
% 8.57/2.10  % (3703894)Instructions burned: 123 (million)
% 8.57/2.10  % (3703893)Instruction limit reached! 
% 8.57/2.10  % (3703893)------------------------------
% 8.57/2.10  % (3703893)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.57/2.10  % (3703893)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.57/2.10  % (3703893)CaDiCaL version: 2.1.3
% 8.57/2.10  % (3703893)Termination reason: Instruction limit
% 8.57/2.10  % (3703893)Termination phase: Saturation
% 8.57/2.10  % (3703893)Time elapsed: 0.118 s
% 8.57/2.10  % (3703893)Peak memory usage: 89 MB
% 8.57/2.10  % (3703893)Instructions burned: 180 (million)
% 8.57/2.10  % (3703904)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=1631714408:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 8.57/2.10  % (3703904)Refutation not found, incomplete strategy
% 8.57/2.10  % (3703904)------------------------------
% 8.57/2.10  % (3703904)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.57/2.10  % (3703904)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.57/2.10  % (3703902)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=3946481163:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 8.57/2.10  % (3703904)CaDiCaL version: 2.1.3
% 8.57/2.10  % (3703904)Termination reason: Refutation not found, incomplete strategy
% 8.57/2.10  % (3703904)Time elapsed: 0.001 s
% 8.57/2.10  % (3703904)Peak memory usage: 87 MB
% 8.57/2.10  % (3703902)Refutation not found, incomplete strategy
% 8.57/2.10  % (3703902)------------------------------
% 8.57/2.10  % (3703902)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.57/2.10  % (3703902)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.57/2.10  % (3703902)CaDiCaL version: 2.1.3
% 8.57/2.10  % (3703902)Termination reason: Refutation not found, incomplete strategy
% 8.57/2.10  % (3703902)Time elapsed: 0.001 s
% 8.57/2.10  % (3703902)Peak memory usage: 87 MB
% 8.57/2.10  % (3703903)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=2452047078: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)
% 8.57/2.10  % (3703905)lrs+10_64_to=lpo:sil=8000:random_seed=3798201420:i=126:bd=preordered_2997 on theBenchmark for (2997ds/126Mi)
% 8.57/2.10  % (3703903)Instruction limit reached! 
% 8.57/2.10  % (3703903)------------------------------
% 8.57/2.10  % (3703903)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.57/2.10  % (3703903)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.57/2.10  % (3703903)CaDiCaL version: 2.1.3
% 8.57/2.10  % (3703903)Termination reason: Instruction limit
% 8.57/2.10  % (3703903)Termination phase: Saturation
% 8.57/2.10  % (3703903)Time elapsed: 0.171 s
% 8.57/2.10  % (3703903)Peak memory usage: 89 MB
% 8.57/2.10  % (3703903)Instructions burned: 189 (million)
% 8.57/2.10  % (3703905)Instruction limit reached! 
% 8.57/2.10  % (3703905)------------------------------
% 8.57/2.10  % (3703905)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.57/2.10  % (3703905)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.57/2.10  % (3703905)CaDiCaL version: 2.1.3
% 8.57/2.10  % (3703905)Termination reason: Instruction limit
% 8.57/2.10  % (3703905)Termination phase: Saturation
% 8.57/2.10  % (3703905)Time elapsed: 0.121 s
% 8.57/2.10  % (3703905)Peak memory usage: 88 MB
% 8.57/2.10  % (3703905)Instructions burned: 126 (million)
% 8.57/2.10  % (3703904)------------------------------
% 8.57/2.10  % (3703904)------------------------------
% 8.57/2.10  % (3703902)------------------------------
% 8.57/2.10  % (3703902)------------------------------
% 8.57/2.10  % (3703925)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=1613891381:avsq=on:i=194:fgj=on:bd=preordered_2993 on theBenchmark for (2993ds/194Mi)
% 8.57/2.10  % (3703926)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=2831099775:i=157:gtg=all_2993 on theBenchmark for (2993ds/157Mi)
% 8.57/2.10  % (3703927)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=1495187326:i=3394:sd=4:ss=included:sgt=64_2992 on theBenchmark for (2992ds/3394Mi)
% 8.57/2.10  % (3703926)First to succeed.
% 8.57/2.10  % (3703926)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3703817"
% 8.57/2.10  % (3703928)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=3249218328:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2991 on theBenchmark for (2991ds/106Mi)
% 8.57/2.10  % (3703925)Instruction limit reached! 
% 8.57/2.10  % (3703925)------------------------------
% 8.57/2.10  % (3703925)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.57/2.10  % (3703925)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.57/2.10  % (3703925)CaDiCaL version: 2.1.3
% 8.57/2.10  % (3703925)Termination reason: Instruction limit
% 8.57/2.10  % (3703925)Termination phase: Saturation
% 8.57/2.10  % (3703925)Time elapsed: 0.131 s
% 8.57/2.10  % (3703925)Peak memory usage: 89 MB
% 8.57/2.10  % (3703925)Instructions burned: 195 (million)
% 8.57/2.10  % (3703889)Also succeeded, but the first one will report.
% 8.57/2.10  % (3703928)Instruction limit reached! 
% 8.57/2.10  % (3703928)------------------------------
% 8.57/2.10  % (3703928)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.57/2.10  % (3703928)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.57/2.10  % (3703928)CaDiCaL version: 2.1.3
% 8.57/2.10  % (3703928)Termination reason: Instruction limit
% 8.57/2.10  % (3703928)Termination phase: Saturation
% 8.57/2.10  % (3703928)Time elapsed: 0.058 s
% 8.57/2.10  % (3703928)Peak memory usage: 88 MB
% 8.57/2.10  % (3703928)Instructions burned: 106 (million)
% 8.57/2.10  % (3703933)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=1340812818:i=107_2989 on theBenchmark for (2989ds/107Mi)
% 8.57/2.10  % (3703933)Refutation not found, incomplete strategy
% 8.57/2.10  % (3703933)------------------------------
% 8.57/2.10  % (3703933)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.57/2.10  % (3703933)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.57/2.10  % (3703933)CaDiCaL version: 2.1.3
% 8.57/2.10  % (3703933)Termination reason: Refutation not found, incomplete strategy
% 8.57/2.10  % (3703933)Time elapsed: 0.001 s
% 8.57/2.10  % (3703933)Peak memory usage: 87 MB
% 8.57/2.10  % (3703934)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=4095353291:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2989 on theBenchmark for (2989ds/242Mi)
% 8.57/2.10  % (3703926)Refutation found. Thanks to Tanya!
% 8.57/2.10  % SZS status Unsatisfiable for theBenchmark
% 8.57/2.10  % SZS output start Proof for theBenchmark
% See solution above
% 9.16/2.29  % (3703926)------------------------------
% 9.16/2.29  % (3703926)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.16/2.29  % (3703926)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.16/2.29  % (3703926)CaDiCaL version: 2.1.3
% 9.16/2.29  % (3703926)Termination reason: Refutation
% 9.16/2.29  % (3703926)Time elapsed: 0.074 s
% 9.16/2.29  % (3703926)Peak memory usage: 91 MB
% 9.16/2.29  % (3703926)Instructions burned: 107 (million)
% 9.16/2.29  % (3703926)------------------------------
% 9.16/2.29  % (3703926)------------------------------
% 9.16/2.29  % (3703817)Success in time 1.229 s
% 9.16/2.29  % Vampire exiting
%------------------------------------------------------------------------------