↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL088-1 : 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 : n011.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:10 AM UTC 2026

% Result   : Unsatisfiable 3.88s 1.51s
% Output   : Refutation 3.88s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   72 (  16 unt;   9 def)
%            Number of atoms       :  161 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  161 (  72   ~;  80   |;   0   &)
%                                         (   9 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :   11 (  10 usr;  10 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :  130 (   0 sgn 130   !;   0   ?)

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

fof(f2,axiom,
    ! [X2,X3,X0,X1,X4] : is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X3)),implies(X4,implies(implies(X3,X0),implies(X2,X0))))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ic_JLukasiewicz_4) ).

fof(f3,negated_conjecture,
    ~ is_a_theorem(implies(implies(implies(a,b),a),a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ic_3) ).

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

fof(f5,plain,
    ! [X2,X3,X0,X1,X4,X5] : is_a_theorem(implies(X0,implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4))))),
    inference(resolution,[],[f4,f2]) ).

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

fof(f9,definition,
    ( spl0_1
  <=> ! [X3,X4,X5,X2,X1] : is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4)))) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f10,plain,
    ( ! [X2,X3,X1,X4,X5] : is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4))))
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f9]) ).

fof(f12,definition,
    ( spl0_2
  <=> ! [X0] : ~ is_a_theorem(X0) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f13,plain,
    ( ! [X0] : ~ is_a_theorem(X0)
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f12]) ).

fof(f14,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f7,f12,f9]) ).

fof(f15,plain,
    ( $false
    | ~ spl0_2 ),
    inference(resolution,[],[f13,f2]) ).

fof(f18,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f15]) ).

fof(f20,plain,
    ( ! [X2,X3,X0,X1,X4] :
        ( ~ is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3)))
        | is_a_theorem(implies(X4,implies(X1,X3))) )
    | ~ spl0_1 ),
    inference(resolution,[],[f10,f1]) ).

fof(f27,plain,
    ( ! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(implies(X1,X2),implies(X3,X2)))))
    | ~ spl0_1 ),
    inference(resolution,[],[f20,f2]) ).

fof(f29,plain,
    ( ! [X2,X0,X1] : is_a_theorem(implies(X0,implies(implies(X1,X2),implies(X2,implies(X1,X2)))))
    | ~ spl0_1 ),
    inference(resolution,[],[f20,f10]) ).

fof(f35,plain,
    ( ! [X2,X3,X0,X1] :
        ( ~ is_a_theorem(X0)
        | is_a_theorem(implies(X1,implies(implies(X1,X2),implies(X3,X2)))) )
    | ~ spl0_1 ),
    inference(resolution,[],[f27,f1]) ).

fof(f37,definition,
    ( spl0_4
  <=> ! [X2,X1,X3] : is_a_theorem(implies(X1,implies(implies(X1,X2),implies(X3,X2)))) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f38,plain,
    ( ! [X2,X3,X1] : is_a_theorem(implies(X1,implies(implies(X1,X2),implies(X3,X2))))
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f37]) ).

fof(f39,plain,
    ( spl0_4
    | spl0_2
    | ~ spl0_1 ),
    inference(avatar_split_clause,[],[f35,f9,f12,f37]) ).

fof(f47,plain,
    ( ! [X2,X3,X0,X1,X4] : is_a_theorem(implies(X0,implies(implies(implies(X1,X2),X3),implies(implies(implies(X3,X4),X2),X3))))
    | ~ spl0_4 ),
    inference(resolution,[],[f38,f4]) ).

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

fof(f63,definition,
    ( spl0_7
  <=> ! [X2,X1] : is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X1,X2)))) ),
    introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).

fof(f64,plain,
    ( ! [X2,X1] : is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X1,X2))))
    | ~ spl0_7 ),
    inference(avatar_component_clause,[],[f63]) ).

fof(f65,plain,
    ( spl0_7
    | spl0_2
    | ~ spl0_1 ),
    inference(avatar_split_clause,[],[f61,f9,f12,f63]) ).

fof(f66,plain,
    ( ! [X2,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(X1,X2),X1),implies(X2,X1))))
    | ~ spl0_7 ),
    inference(resolution,[],[f64,f4]) ).

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

fof(f112,definition,
    ( spl0_8
  <=> ! [X2,X1] : is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X2,X1))) ),
    introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).

fof(f113,plain,
    ( ! [X2,X1] : is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X2,X1)))
    | ~ spl0_8 ),
    inference(avatar_component_clause,[],[f112]) ).

fof(f114,plain,
    ( spl0_8
    | spl0_2
    | ~ spl0_7 ),
    inference(avatar_split_clause,[],[f110,f63,f12,f112]) ).

fof(f120,plain,
    ( ! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X1))))
    | ~ spl0_1
    | ~ spl0_8 ),
    inference(resolution,[],[f113,f20]) ).

fof(f138,plain,
    ( ! [X2,X0,X1] :
        ( ~ is_a_theorem(X0)
        | is_a_theorem(implies(X1,implies(X2,X1))) )
    | ~ spl0_1
    | ~ spl0_8 ),
    inference(resolution,[],[f120,f1]) ).

fof(f140,definition,
    ( spl0_10
  <=> ! [X2,X1] : is_a_theorem(implies(X1,implies(X2,X1))) ),
    introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).

fof(f141,plain,
    ( ! [X2,X1] : is_a_theorem(implies(X1,implies(X2,X1)))
    | ~ spl0_10 ),
    inference(avatar_component_clause,[],[f140]) ).

fof(f142,plain,
    ( spl0_10
    | spl0_2
    | ~ spl0_1
    | ~ spl0_8 ),
    inference(avatar_split_clause,[],[f138,f112,f9,f12,f140]) ).

fof(f152,plain,
    ( ! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(X1,X2),X1),implies(X3,X1))))
    | ~ spl0_10 ),
    inference(resolution,[],[f141,f4]) ).

fof(f657,plain,
    ( ! [X2,X3,X0,X1,X4] :
        ( ~ is_a_theorem(X0)
        | is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(implies(X3,X4),X2),X3))) )
    | ~ spl0_4 ),
    inference(resolution,[],[f47,f1]) ).

fof(f659,definition,
    ( spl0_41
  <=> ! [X2,X4,X1,X3] : is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(implies(X3,X4),X2),X3))) ),
    introduced(definition,[new_symbols(definition,[spl0_41])],[avatar_definition]) ).

fof(f660,plain,
    ( ! [X2,X3,X1,X4] : is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(implies(X3,X4),X2),X3)))
    | ~ spl0_41 ),
    inference(avatar_component_clause,[],[f659]) ).

fof(f661,plain,
    ( spl0_41
    | spl0_2
    | ~ spl0_4 ),
    inference(avatar_split_clause,[],[f657,f37,f12,f659]) ).

fof(f1041,plain,
    ( ! [X2,X3,X0,X1] :
        ( ~ is_a_theorem(X0)
        | is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1))) )
    | ~ spl0_10 ),
    inference(resolution,[],[f152,f1]) ).

fof(f1043,definition,
    ( spl0_53
  <=> ! [X2,X1,X3] : is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1))) ),
    introduced(definition,[new_symbols(definition,[spl0_53])],[avatar_definition]) ).

fof(f1044,plain,
    ( ! [X2,X3,X1] : is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1)))
    | ~ spl0_53 ),
    inference(avatar_component_clause,[],[f1043]) ).

fof(f1045,plain,
    ( spl0_53
    | spl0_2
    | ~ spl0_10 ),
    inference(avatar_split_clause,[],[f1041,f140,f12,f1043]) ).

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

fof(f2174,plain,
    ( ! [X2,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(X1,X2),X1),X1)))
    | ~ spl0_41
    | ~ spl0_53 ),
    inference(resolution,[],[f660,f1077]) ).

fof(f2207,plain,
    ( ! [X2,X0,X1] :
        ( ~ is_a_theorem(X0)
        | is_a_theorem(implies(implies(implies(X1,X2),X1),X1)) )
    | ~ spl0_41
    | ~ spl0_53 ),
    inference(resolution,[],[f2174,f1]) ).

fof(f2215,definition,
    ( spl0_73
  <=> ! [X2,X1] : is_a_theorem(implies(implies(implies(X1,X2),X1),X1)) ),
    introduced(definition,[new_symbols(definition,[spl0_73])],[avatar_definition]) ).

fof(f2216,plain,
    ( ! [X2,X1] : is_a_theorem(implies(implies(implies(X1,X2),X1),X1))
    | ~ spl0_73 ),
    inference(avatar_component_clause,[],[f2215]) ).

fof(f2217,plain,
    ( spl0_73
    | spl0_2
    | ~ spl0_41
    | ~ spl0_53 ),
    inference(avatar_split_clause,[],[f2207,f1043,f659,f12,f2215]) ).

fof(f2262,plain,
    ( $false
    | ~ spl0_73 ),
    inference(resolution,[],[f2216,f3]) ).

fof(f2270,plain,
    ~ spl0_73,
    inference(avatar_contradiction_clause,[],[f2262]) ).

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

cnf(s3,plain,
    ~ spl0_2,
    inference(sat_conversion,[],[f18]) ).

cnf(s5,plain,
    ( ~ spl0_1
    | spl0_2
    | spl0_4 ),
    inference(sat_conversion,[],[f39]) ).

cnf(s8,plain,
    ( ~ spl0_1
    | spl0_2
    | spl0_7 ),
    inference(sat_conversion,[],[f65]) ).

cnf(s9,plain,
    ( spl0_2
    | ~ spl0_7
    | spl0_8 ),
    inference(sat_conversion,[],[f114]) ).

cnf(s11,plain,
    ( ~ spl0_1
    | spl0_2
    | ~ spl0_8
    | spl0_10 ),
    inference(sat_conversion,[],[f142]) ).

cnf(s45,plain,
    ( spl0_2
    | ~ spl0_4
    | spl0_41 ),
    inference(sat_conversion,[],[f661]) ).

cnf(s59,plain,
    ( spl0_2
    | ~ spl0_10
    | spl0_53 ),
    inference(sat_conversion,[],[f1045]) ).

cnf(s99,plain,
    ( spl0_2
    | ~ spl0_41
    | ~ spl0_53
    | spl0_73 ),
    inference(sat_conversion,[],[f2217]) ).

cnf(s105,plain,
    ~ spl0_73,
    inference(sat_conversion,[],[f2270]) ).

cnf(s106,plain,
    ( spl0_2
    | ~ spl0_41
    | ~ spl0_53 ),
    inference(rat,[],[s99,s105]) ).

cnf(s115,plain,
    spl0_1,
    inference(rat,[],[s1,s3]) ).

cnf(s123,plain,
    spl0_7,
    inference(rat,[],[s8,s3,s115]) ).

cnf(s125,plain,
    spl0_4,
    inference(rat,[],[s5,s3,s115]) ).

cnf(s127,plain,
    spl0_8,
    inference(rat,[],[s9,s3,s123]) ).

cnf(s136,plain,
    spl0_41,
    inference(rat,[],[s45,s3,s125]) ).

cnf(s161,plain,
    spl0_10,
    inference(rat,[],[s11,s115,s3,s127]) ).

cnf(s164,plain,
    ~ spl0_53,
    inference(rat,[],[s106,s3,s136]) ).

cnf(s166,plain,
    $false,
    inference(rat,[],[s59,s3,s164,s161]) ).

fof(f2271,plain,
    $false,
    inference(avatar_sat_refutation,[],[s166]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL088-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.39  % Computer : n011.cluster.edu
% 0.12/0.39  % Model    : x86_64 x86_64
% 0.12/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39  % Memory   : 8046.5625MB
% 0.12/0.39  % OS       : Linux 6.8.0-71-generic
% 0.12/0.39  % CPULimit : 300
% 0.12/0.39  % WCLimit  : 300
% 0.12/0.39  % DateTime : Sun Sep 27 15:21:15 UTC 2026
% 0.12/0.39  % CPUTime  : 
% 0.12/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42  Running first-order theorem proving
% 0.12/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
% 3.12/1.32  % (2542443)Input is clausal, will run a generic CNF schedule.
% 3.12/1.32  % (2542452)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2422115994:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.12/1.32  % (2542453)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=190086066:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.12/1.32  % (2542451)lrs+10_1_sil=8000:sp=occurrence:random_seed=2524415581:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.12/1.32  % (2542448)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=1028093728:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.12/1.32  % (2542450)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3431306695:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.12/1.32  % (2542449)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=42423992:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.12/1.32  % (2542452)Instruction limit reached! 
% 3.12/1.32  % (2542452)------------------------------
% 3.12/1.32  % (2542452)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.12/1.32  % (2542452)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.12/1.32  % (2542452)CaDiCaL version: 2.1.3
% 3.12/1.32  % (2542452)Termination reason: Instruction limit
% 3.12/1.32  % (2542452)Termination phase: Saturation
% 3.12/1.32  % (2542452)Time elapsed: 0.041 s
% 3.12/1.32  % (2542452)Peak memory usage: 88 MB
% 3.12/1.32  % (2542452)Instructions burned: 115 (million)
% 3.12/1.32  % (2542454)dis-21_1_sil=8000:lcm=predicate:random_seed=403907201: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.12/1.32  % (2542451)First to succeed.
% 3.12/1.32  % (2542451)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2542443"
% 3.12/1.32  % (2542454)Instruction limit reached! 
% 3.12/1.32  % (2542454)------------------------------
% 3.12/1.32  % (2542454)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.12/1.32  % (2542454)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.12/1.32  % (2542454)CaDiCaL version: 2.1.3
% 3.12/1.32  % (2542454)Termination reason: Instruction limit
% 3.12/1.32  % (2542454)Termination phase: Saturation
% 3.12/1.32  % (2542454)Time elapsed: 0.069 s
% 3.12/1.32  % (2542454)Peak memory usage: 89 MB
% 3.12/1.32  % (2542454)Instructions burned: 118 (million)
% 3.12/1.32  % (2542462)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=183700849:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 3.12/1.32  % (2542462)Refutation not found, incomplete strategy
% 3.12/1.32  % (2542462)------------------------------
% 3.12/1.32  % (2542462)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.12/1.32  % (2542462)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.12/1.32  % (2542462)CaDiCaL version: 2.1.3
% 3.12/1.32  % (2542462)Termination reason: Refutation not found, incomplete strategy
% 3.12/1.32  % (2542462)Time elapsed: 0.0000 s
% 3.12/1.32  % (2542462)Peak memory usage: 87 MB
% 3.12/1.32  % (2542453)Instruction limit reached! 
% 3.12/1.32  % (2542453)------------------------------
% 3.12/1.32  % (2542453)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.12/1.32  % (2542453)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.12/1.32  % (2542453)CaDiCaL version: 2.1.3
% 3.12/1.32  % (2542453)Termination reason: Instruction limit
% 3.12/1.32  % (2542453)Termination phase: Saturation
% 3.12/1.32  % (2542453)Time elapsed: 0.121 s
% 3.12/1.32  % (2542453)Peak memory usage: 88 MB
% 3.12/1.32  % (2542453)Instructions burned: 180 (million)
% 3.12/1.32  % (2542463)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=1271264394: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.12/1.32  % (2542462)------------------------------
% 3.12/1.32  % (2542462)------------------------------
% 3.12/1.32  % (2542465)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=3322035734:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 3.12/1.32  % (2542465)Refutation not found, incomplete strategy
% 3.88/1.51  % (2542465)------------------------------
% 3.88/1.51  % (2542465)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.88/1.51  % (2542465)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.88/1.51  % (2542465)CaDiCaL version: 2.1.3
% 3.88/1.51  % (2542465)Termination reason: Refutation not found, incomplete strategy
% 3.88/1.51  % (2542465)Time elapsed: 0.001 s
% 3.88/1.51  % (2542465)Peak memory usage: 87 MB
% 3.88/1.51  % (2542451)Refutation found. Thanks to Tanya!
% 3.88/1.51  % SZS status Unsatisfiable for theBenchmark
% 3.88/1.51  % SZS output start Proof for theBenchmark
% See solution above
% 3.88/1.51  % (2542451)------------------------------
% 3.88/1.51  % (2542451)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.88/1.51  % (2542451)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.88/1.51  % (2542451)CaDiCaL version: 2.1.3
% 3.88/1.51  % (2542451)Termination reason: Refutation
% 3.88/1.51  % (2542451)Time elapsed: 0.048 s
% 3.88/1.51  % (2542451)Peak memory usage: 90 MB
% 3.88/1.51  % (2542451)Instructions burned: 68 (million)
% 3.88/1.51  % (2542451)------------------------------
% 3.88/1.51  % (2542451)------------------------------
% 3.88/1.51  % (2542443)Success in time 0.456 s
% 3.88/1.51  % Vampire exiting
%------------------------------------------------------------------------------