↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL006-1 : 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 : n008.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:50:54 AM UTC 2026

% Result   : Unsatisfiable 7.03s 7.07s
% Output   : Refutation 7.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   86 (  35 unt;  15 def)
%            Number of atoms       :  160 (  20 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :  141 (  67   ~;  64   |;   0   &)
%                                         (  10 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :   13 (  11 usr;  11 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   8 con; 0-2 aty)
%            Number of variables   :   33 (   0 sgn  33   !;   0   ?)

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

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

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

fof(f4,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,a)),equivalent(b,c))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ec_1) ).

fof(f5,definition,
    sF0 = equivalent(a,b),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f6,plain,
    equivalent(a,b) = sF0,
    inference(reorient_equations,[],[f5]) ).

fof(f7,definition,
    sF1 = equivalent(c,a),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f8,plain,
    equivalent(c,a) = sF1,
    inference(reorient_equations,[],[f7]) ).

fof(f9,definition,
    sF2 = equivalent(sF0,sF1),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f10,plain,
    equivalent(sF0,sF1) = sF2,
    inference(reorient_equations,[],[f9]) ).

fof(f11,definition,
    sF3 = equivalent(b,c),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f12,plain,
    equivalent(b,c) = sF3,
    inference(reorient_equations,[],[f11]) ).

fof(f13,definition,
    sF4 = equivalent(sF2,sF3),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f14,plain,
    equivalent(sF2,sF3) = sF4,
    inference(reorient_equations,[],[f13]) ).

fof(f15,plain,
    ~ is_a_theorem(sF4),
    inference(definition_folding,[],[f4,f14,f12,f10,f8,f6]) ).

fof(f17,definition,
    ( spl5_1
  <=> is_a_theorem(sF4) ),
    introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition]) ).

fof(f19,plain,
    ( ~ is_a_theorem(sF4)
    | spl5_1 ),
    inference(avatar_component_clause,[],[f17]) ).

fof(f20,plain,
    ~ spl5_1,
    inference(avatar_split_clause,[],[f15,f17]) ).

fof(f22,definition,
    ( spl5_2
  <=> equivalent(a,b) = sF0 ),
    introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition]) ).

fof(f24,plain,
    ( equivalent(a,b) = sF0
    | ~ spl5_2 ),
    inference(avatar_component_clause,[],[f22]) ).

fof(f25,plain,
    spl5_2,
    inference(avatar_split_clause,[],[f6,f22]) ).

fof(f27,definition,
    ( spl5_3
  <=> equivalent(c,a) = sF1 ),
    introduced(definition,[new_symbols(definition,[spl5_3])],[avatar_definition]) ).

fof(f29,plain,
    ( equivalent(c,a) = sF1
    | ~ spl5_3 ),
    inference(avatar_component_clause,[],[f27]) ).

fof(f30,plain,
    spl5_3,
    inference(avatar_split_clause,[],[f8,f27]) ).

fof(f32,definition,
    ( spl5_4
  <=> equivalent(sF0,sF1) = sF2 ),
    introduced(definition,[new_symbols(definition,[spl5_4])],[avatar_definition]) ).

fof(f34,plain,
    ( equivalent(sF0,sF1) = sF2
    | ~ spl5_4 ),
    inference(avatar_component_clause,[],[f32]) ).

fof(f35,plain,
    spl5_4,
    inference(avatar_split_clause,[],[f10,f32]) ).

fof(f37,definition,
    ( spl5_5
  <=> equivalent(b,c) = sF3 ),
    introduced(definition,[new_symbols(definition,[spl5_5])],[avatar_definition]) ).

fof(f39,plain,
    ( equivalent(b,c) = sF3
    | ~ spl5_5 ),
    inference(avatar_component_clause,[],[f37]) ).

fof(f40,plain,
    spl5_5,
    inference(avatar_split_clause,[],[f12,f37]) ).

fof(f42,definition,
    ( spl5_6
  <=> equivalent(sF2,sF3) = sF4 ),
    introduced(definition,[new_symbols(definition,[spl5_6])],[avatar_definition]) ).

fof(f44,plain,
    ( equivalent(sF2,sF3) = sF4
    | ~ spl5_6 ),
    inference(avatar_component_clause,[],[f42]) ).

fof(f45,plain,
    spl5_6,
    inference(avatar_split_clause,[],[f14,f42]) ).

fof(f83,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(equivalent(X0,X1))
      | is_a_theorem(equivalent(X1,X0)) ),
    inference(resolution,[],[f2,f1]) ).

fof(f144,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(equivalent(equivalent(X0,X1),X2))
      | is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
    inference(resolution,[],[f3,f1]) ).

fof(f145,plain,
    ( ! [X0] : is_a_theorem(equivalent(equivalent(sF0,X0),equivalent(a,equivalent(b,X0))))
    | ~ spl5_2 ),
    inference(superposition,[],[f3,f24]) ).

fof(f146,plain,
    ( ! [X0] : is_a_theorem(equivalent(equivalent(sF3,X0),equivalent(b,equivalent(c,X0))))
    | ~ spl5_5 ),
    inference(superposition,[],[f3,f39]) ).

fof(f149,plain,
    ( ! [X0] : is_a_theorem(equivalent(equivalent(sF4,X0),equivalent(sF2,equivalent(sF3,X0))))
    | ~ spl5_6 ),
    inference(superposition,[],[f3,f44]) ).

fof(f215,plain,
    ( is_a_theorem(equivalent(sF2,equivalent(a,equivalent(b,sF1))))
    | ~ spl5_2
    | ~ spl5_4 ),
    inference(superposition,[],[f145,f34]) ).

fof(f223,definition,
    ( spl5_30
  <=> is_a_theorem(equivalent(sF2,equivalent(a,equivalent(b,sF1)))) ),
    introduced(definition,[new_symbols(definition,[spl5_30])],[avatar_definition]) ).

fof(f225,plain,
    ( is_a_theorem(equivalent(sF2,equivalent(a,equivalent(b,sF1))))
    | ~ spl5_30 ),
    inference(avatar_component_clause,[],[f223]) ).

fof(f226,plain,
    ( spl5_30
    | ~ spl5_2
    | ~ spl5_4 ),
    inference(avatar_split_clause,[],[f215,f32,f22,f223]) ).

fof(f245,plain,
    ( is_a_theorem(equivalent(equivalent(sF3,a),equivalent(b,sF1)))
    | ~ spl5_3
    | ~ spl5_5 ),
    inference(superposition,[],[f146,f29]) ).

fof(f247,definition,
    ( spl5_34
  <=> is_a_theorem(equivalent(equivalent(sF3,a),equivalent(b,sF1))) ),
    introduced(definition,[new_symbols(definition,[spl5_34])],[avatar_definition]) ).

fof(f249,plain,
    ( is_a_theorem(equivalent(equivalent(sF3,a),equivalent(b,sF1)))
    | ~ spl5_34 ),
    inference(avatar_component_clause,[],[f247]) ).

fof(f250,plain,
    ( spl5_34
    | ~ spl5_3
    | ~ spl5_5 ),
    inference(avatar_split_clause,[],[f245,f37,f27,f247]) ).

fof(f259,plain,
    ( is_a_theorem(equivalent(equivalent(a,equivalent(b,sF1)),sF2))
    | ~ spl5_30 ),
    inference(resolution,[],[f225,f83]) ).

fof(f262,definition,
    ( spl5_36
  <=> is_a_theorem(equivalent(equivalent(a,equivalent(b,sF1)),sF2)) ),
    introduced(definition,[new_symbols(definition,[spl5_36])],[avatar_definition]) ).

fof(f264,plain,
    ( is_a_theorem(equivalent(equivalent(a,equivalent(b,sF1)),sF2))
    | ~ spl5_36 ),
    inference(avatar_component_clause,[],[f262]) ).

fof(f265,plain,
    ( spl5_36
    | ~ spl5_30 ),
    inference(avatar_split_clause,[],[f259,f223,f262]) ).

fof(f353,plain,
    ! [X0,X1] : is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X1,X0)))),
    inference(resolution,[],[f144,f2]) ).

fof(f354,plain,
    ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,equivalent(X0,equivalent(X1,X2))))),
    inference(resolution,[],[f144,f3]) ).

fof(f366,plain,
    ( is_a_theorem(equivalent(sF3,equivalent(a,equivalent(b,sF1))))
    | ~ spl5_34 ),
    inference(resolution,[],[f144,f249]) ).

fof(f367,plain,
    ( ! [X0] : is_a_theorem(equivalent(sF4,equivalent(X0,equivalent(sF2,equivalent(sF3,X0)))))
    | ~ spl5_6 ),
    inference(resolution,[],[f144,f149]) ).

fof(f410,definition,
    ( spl5_55
  <=> is_a_theorem(equivalent(sF3,equivalent(a,equivalent(b,sF1)))) ),
    introduced(definition,[new_symbols(definition,[spl5_55])],[avatar_definition]) ).

fof(f412,plain,
    ( is_a_theorem(equivalent(sF3,equivalent(a,equivalent(b,sF1))))
    | ~ spl5_55 ),
    inference(avatar_component_clause,[],[f410]) ).

fof(f413,plain,
    ( spl5_55
    | ~ spl5_34 ),
    inference(avatar_split_clause,[],[f366,f247,f410]) ).

fof(f508,plain,
    ! [X0,X1] :
      ( is_a_theorem(equivalent(X1,equivalent(X1,X0)))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f353,f1]) ).

fof(f762,plain,
    ( ! [X0] : is_a_theorem(equivalent(equivalent(X0,equivalent(sF2,equivalent(sF3,X0))),sF4))
    | ~ spl5_6 ),
    inference(resolution,[],[f367,f83]) ).

fof(f789,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(equivalent(X2,equivalent(X0,equivalent(X1,X2))))
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(resolution,[],[f354,f1]) ).

fof(f885,plain,
    ! [X0,X1] :
      ( is_a_theorem(equivalent(X1,X0))
      | ~ is_a_theorem(X1)
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f508,f1]) ).

fof(f1467,plain,
    ( ! [X0] :
        ( ~ is_a_theorem(equivalent(X0,equivalent(sF2,equivalent(sF3,X0))))
        | is_a_theorem(sF4) )
    | ~ spl5_6 ),
    inference(resolution,[],[f762,f1]) ).

fof(f1468,plain,
    ( ! [X0] : ~ is_a_theorem(equivalent(X0,equivalent(sF2,equivalent(sF3,X0))))
    | spl5_1
    | ~ spl5_6 ),
    inference(forward_subsumption_resolution,[],[f1467,f19]) ).

fof(f1771,plain,
    ( ! [X0] :
        ( ~ is_a_theorem(equivalent(sF2,equivalent(sF3,X0)))
        | ~ is_a_theorem(X0) )
    | spl5_1
    | ~ spl5_6 ),
    inference(resolution,[],[f885,f1468]) ).

fof(f1945,plain,
    ( ! [X0] :
        ( ~ is_a_theorem(equivalent(sF3,X0))
        | ~ is_a_theorem(equivalent(X0,sF2)) )
    | spl5_1
    | ~ spl5_6 ),
    inference(resolution,[],[f1771,f789]) ).

fof(f2442,plain,
    ( ~ is_a_theorem(equivalent(equivalent(a,equivalent(b,sF1)),sF2))
    | spl5_1
    | ~ spl5_6
    | ~ spl5_55 ),
    inference(resolution,[],[f1945,f412]) ).

fof(f2525,plain,
    ( $false
    | spl5_1
    | ~ spl5_6
    | ~ spl5_36
    | ~ spl5_55 ),
    inference(forward_subsumption_resolution,[],[f2442,f264]) ).

fof(f2526,plain,
    ( spl5_1
    | ~ spl5_6
    | ~ spl5_36
    | ~ spl5_55 ),
    inference(avatar_contradiction_clause,[],[f2525]) ).

cnf(s1,plain,
    ~ spl5_1,
    inference(sat_conversion,[],[f20]) ).

cnf(s2,plain,
    spl5_2,
    inference(sat_conversion,[],[f25]) ).

cnf(s3,plain,
    spl5_3,
    inference(sat_conversion,[],[f30]) ).

cnf(s4,plain,
    spl5_4,
    inference(sat_conversion,[],[f35]) ).

cnf(s5,plain,
    spl5_5,
    inference(sat_conversion,[],[f40]) ).

cnf(s6,plain,
    spl5_6,
    inference(sat_conversion,[],[f45]) ).

cnf(s28,plain,
    ( ~ spl5_2
    | ~ spl5_4
    | spl5_30 ),
    inference(sat_conversion,[],[f226]) ).

cnf(s31,plain,
    ( ~ spl5_3
    | ~ spl5_5
    | spl5_34 ),
    inference(sat_conversion,[],[f250]) ).

cnf(s33,plain,
    ( ~ spl5_30
    | spl5_36 ),
    inference(sat_conversion,[],[f265]) ).

cnf(s50,plain,
    ( ~ spl5_34
    | spl5_55 ),
    inference(sat_conversion,[],[f413]) ).

cnf(s259,plain,
    ( spl5_1
    | ~ spl5_6
    | ~ spl5_36
    | ~ spl5_55 ),
    inference(sat_conversion,[],[f2526]) ).

cnf(s307,plain,
    spl5_34,
    inference(rat,[],[s31,s5,s3]) ).

cnf(s315,plain,
    spl5_55,
    inference(rat,[],[s50,s307]) ).

cnf(s335,plain,
    spl5_30,
    inference(rat,[],[s28,s4,s2]) ).

cnf(s345,plain,
    spl5_36,
    inference(rat,[],[s33,s335]) ).

cnf(s354,plain,
    spl5_1,
    inference(rat,[],[s259,s315,s6,s345]) ).

cnf(s366,plain,
    $false,
    inference(rat,[],[s1,s354]) ).

fof(f2527,plain,
    $false,
    inference(avatar_sat_refutation,[],[s366]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL006-1 : 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/5.61  % Computer : n008.cluster.edu
% 0.13/5.61  % Model    : x86_64 x86_64
% 0.13/5.61  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.61  % Memory   : 8046.5625MB
% 0.13/5.61  % OS       : Linux 6.8.0-71-generic
% 0.13/5.61  % CPULimit : 300
% 0.13/5.61  % WCLimit  : 300
% 0.13/5.61  % DateTime : Sun Sep 27 15:17:35 UTC 2026
% 0.13/5.62  % CPUTime  : 
% 0.13/5.62  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/5.65  Running first-order theorem proving
% 0.13/5.65  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
% 7.03/7.07  % (1360526)Input is clausal, will run a generic CNF schedule.
% 7.03/7.07  % (1360531)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=292365125:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 7.03/7.07  % (1360535)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2264597237:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 7.03/7.07  % (1360534)lrs+10_1_sil=8000:sp=occurrence:random_seed=3867169854:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 7.03/7.07  % (1360533)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3204371197:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 7.03/7.07  % (1360532)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3640390143:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 7.03/7.07  % (1360537)dis-21_1_sil=8000:lcm=predicate:random_seed=2709888996: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)
% 7.03/7.07  % (1360536)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1708128739:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 7.03/7.07  % (1360534)Instruction limit reached! 
% 7.03/7.07  % (1360534)------------------------------
% 7.03/7.07  % (1360534)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.03/7.07  % (1360534)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.03/7.07  % (1360534)CaDiCaL version: 2.1.3
% 7.03/7.07  % (1360534)Termination reason: Instruction limit
% 7.03/7.07  % (1360534)Termination phase: Saturation
% 7.03/7.07  % (1360534)Time elapsed: 0.066 s
% 7.03/7.07  % (1360534)Peak memory usage: 88 MB
% 7.03/7.07  % (1360534)Instructions burned: 107 (million)
% 7.03/7.07  % (1360535)Instruction limit reached! 
% 7.03/7.07  % (1360535)------------------------------
% 7.03/7.07  % (1360535)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.03/7.07  % (1360535)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.03/7.07  % (1360535)CaDiCaL version: 2.1.3
% 7.03/7.07  % (1360535)Termination reason: Instruction limit
% 7.03/7.07  % (1360535)Termination phase: Saturation
% 7.03/7.07  % (1360535)Time elapsed: 0.071 s
% 7.03/7.07  % (1360535)Peak memory usage: 88 MB
% 7.03/7.07  % (1360535)Instructions burned: 115 (million)
% 7.03/7.07  % (1360537)Instruction limit reached! 
% 7.03/7.07  % (1360537)------------------------------
% 7.03/7.07  % (1360537)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.03/7.07  % (1360537)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.03/7.07  % (1360537)CaDiCaL version: 2.1.3
% 7.03/7.07  % (1360537)Termination reason: Instruction limit
% 7.03/7.07  % (1360537)Termination phase: Saturation
% 7.03/7.07  % (1360537)Time elapsed: 0.072 s
% 7.03/7.07  % (1360537)Peak memory usage: 88 MB
% 7.03/7.07  % (1360537)Instructions burned: 119 (million)
% 7.03/7.07  % (1360536)Instruction limit reached! 
% 7.03/7.07  % (1360536)------------------------------
% 7.03/7.07  % (1360536)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.03/7.07  % (1360536)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.03/7.07  % (1360536)CaDiCaL version: 2.1.3
% 7.03/7.07  % (1360536)Termination reason: Instruction limit
% 7.03/7.07  % (1360536)Termination phase: Saturation
% 7.03/7.07  % (1360536)Time elapsed: 0.119 s
% 7.03/7.07  % (1360536)Peak memory usage: 89 MB
% 7.03/7.07  % (1360536)Instructions burned: 180 (million)
% 7.03/7.07  % (1360545)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=800422009:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 7.03/7.07  % (1360545)Refutation not found, incomplete strategy
% 7.03/7.07  % (1360545)------------------------------
% 7.03/7.07  % (1360545)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.03/7.07  % (1360545)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.03/7.07  % (1360545)CaDiCaL version: 2.1.3
% 7.03/7.07  % (1360545)Termination reason: Refutation not found, incomplete strategy
% 7.03/7.07  % (1360545)Time elapsed: 0.001 s
% 7.03/7.07  % (1360545)Peak memory usage: 87 MB
% 7.03/7.07  % (1360546)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=858258560: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)
% 7.03/7.07  % (1360547)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=3200300938:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 7.03/7.07  % (1360547)Refutation not found, incomplete strategy
% 7.03/7.07  % (1360547)------------------------------
% 7.03/7.07  % (1360547)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.03/7.07  % (1360547)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.03/7.07  % (1360547)CaDiCaL version: 2.1.3
% 7.03/7.07  % (1360547)Termination reason: Refutation not found, incomplete strategy
% 7.03/7.07  % (1360547)Time elapsed: 0.001 s
% 7.03/7.07  % (1360547)Peak memory usage: 87 MB
% 7.03/7.07  % (1360548)lrs+10_64_to=lpo:sil=8000:random_seed=481508195:i=126:bd=preordered_2997 on theBenchmark for (2997ds/126Mi)
% 7.03/7.07  % (1360546)Instruction limit reached! 
% 7.03/7.07  % (1360546)------------------------------
% 7.03/7.07  % (1360546)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.03/7.07  % (1360546)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.03/7.07  % (1360546)CaDiCaL version: 2.1.3
% 7.03/7.07  % (1360546)Termination reason: Instruction limit
% 7.03/7.07  % (1360546)Termination phase: Saturation
% 7.03/7.07  % (1360546)Time elapsed: 0.111 s
% 7.03/7.07  % (1360546)Peak memory usage: 89 MB
% 7.03/7.07  % (1360546)Instructions burned: 189 (million)
% 7.03/7.07  % (1360548)Instruction limit reached! 
% 7.03/7.07  % (1360548)------------------------------
% 7.03/7.07  % (1360548)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.03/7.07  % (1360548)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.03/7.07  % (1360548)CaDiCaL version: 2.1.3
% 7.03/7.07  % (1360548)Termination reason: Instruction limit
% 7.03/7.07  % (1360548)Termination phase: Saturation
% 7.03/7.07  % (1360548)Time elapsed: 0.075 s
% 7.03/7.07  % (1360548)Peak memory usage: 88 MB
% 7.03/7.07  % (1360548)Instructions burned: 126 (million)
% 7.03/7.07  % (1360545)------------------------------
% 7.03/7.07  % (1360545)------------------------------
% 7.03/7.07  % (1360547)------------------------------
% 7.03/7.07  % (1360547)------------------------------
% 7.03/7.07  % (1360553)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=3888556649:avsq=on:i=194:fgj=on:bd=preordered_2994 on theBenchmark for (2994ds/194Mi)
% 7.03/7.07  % (1360554)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=4050485283:i=157:gtg=all_2994 on theBenchmark for (2994ds/157Mi)
% 7.03/7.07  % (1360554)First to succeed.
% 7.03/7.07  % (1360554)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1360526"
% 7.03/7.07  % (1360553)Also succeeded, but the first one will report.
% 7.03/7.07  % (1360555)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=2474643555:i=3394:sd=4:ss=included:sgt=64_2993 on theBenchmark for (2993ds/3394Mi)
% 7.03/7.07  % (1360556)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=3361589202:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2993 on theBenchmark for (2993ds/106Mi)
% 7.03/7.07  % (1360556)Instruction limit reached! 
% 7.03/7.07  % (1360556)------------------------------
% 7.03/7.07  % (1360556)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.03/7.07  % (1360556)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.03/7.07  % (1360556)CaDiCaL version: 2.1.3
% 7.03/7.07  % (1360556)Termination reason: Instruction limit
% 7.03/7.07  % (1360556)Termination phase: Saturation
% 7.03/7.07  % (1360556)Time elapsed: 0.057 s
% 7.03/7.07  % (1360556)Peak memory usage: 88 MB
% 7.03/7.07  % (1360556)Instructions burned: 106 (million)
% 7.03/7.07  % (1360554)Refutation found. Thanks to Tanya!
% 7.03/7.07  % SZS status Unsatisfiable for theBenchmark
% 7.03/7.07  % SZS output start Proof for theBenchmark
% See solution above
% 7.47/7.26  % (1360554)------------------------------
% 7.47/7.26  % (1360554)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.47/7.26  % (1360554)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.47/7.26  % (1360554)CaDiCaL version: 2.1.3
% 7.47/7.26  % (1360554)Termination reason: Refutation
% 7.47/7.26  % (1360554)Time elapsed: 0.046 s
% 7.47/7.26  % (1360554)Peak memory usage: 91 MB
% 7.47/7.26  % (1360554)Instructions burned: 64 (million)
% 7.47/7.26  % (1360554)------------------------------
% 7.47/7.26  % (1360554)------------------------------
% 7.47/7.26  % (1360526)Success in time 0.975 s
% 7.47/7.26  % Vampire exiting
%------------------------------------------------------------------------------