↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL090-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 : n007.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.06s 1.48s
% Output   : Refutation 4.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   87 (  23 unt;  10 def)
%            Number of atoms       :  183 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  173 (  77   ~;  86   |;   0   &)
%                                         (  10 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :   12 (  11 usr;  11 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-2 aty)
%            Number of variables   :  215 (   0 sgn 215   !;   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(implies(X3,X0),implies(X4,implies(X2,X0))))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ic_JLukasiewicz_5) ).

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

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

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

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

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

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

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

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

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

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

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

fof(f18,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f9,f16,f13]) ).

fof(f19,plain,
    ! [X2,X3,X0,X1,X4,X5] : is_a_theorem(implies(X0,implies(implies(X1,implies(X2,X3)),implies(implies(X2,X3),implies(X4,implies(X5,implies(X2,X3))))))),
    inference(resolution,[],[f6,f7]) ).

fof(f20,plain,
    ! [X2,X3,X0,X1,X6,X7,X4,X5] : is_a_theorem(implies(implies(implies(X0,implies(X1,implies(X2,X3))),implies(implies(X4,X3),implies(X3,X5))),implies(X6,implies(X7,implies(implies(X4,X3),implies(X3,X5)))))),
    inference(resolution,[],[f6,f4]) ).

fof(f24,plain,
    ( $false
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f19,f17]) ).

fof(f25,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f24]) ).

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

fof(f44,plain,
    ( ! [X2,X3,X0,X1,X4] : is_a_theorem(implies(X0,implies(implies(X1,X2),implies(X2,implies(X3,implies(X4,X2))))))
    | ~ spl0_1 ),
    inference(resolution,[],[f26,f7]) ).

fof(f48,plain,
    ! [X2,X3,X0,X1,X8,X6,X7,X4,X5] : is_a_theorem(implies(implies(implies(X0,implies(implies(X1,X2),implies(X2,X3))),implies(X4,implies(X5,implies(X6,X2)))),implies(X7,implies(X8,implies(X4,implies(X5,implies(X6,X2))))))),
    inference(resolution,[],[f20,f4]) ).

fof(f50,plain,
    ! [X2,X3,X0,X1,X6,X7,X4,X5] :
      ( ~ is_a_theorem(implies(implies(X0,implies(X1,implies(X2,X3))),implies(implies(X4,X3),implies(X3,X5))))
      | is_a_theorem(implies(X6,implies(X7,implies(implies(X4,X3),implies(X3,X5))))) ),
    inference(resolution,[],[f20,f1]) ).

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

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

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

fof(f59,plain,
    ( spl0_4
    | spl0_2
    | ~ spl0_1 ),
    inference(avatar_split_clause,[],[f52,f13,f16,f57]) ).

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

fof(f198,plain,
    ! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
      ( ~ is_a_theorem(implies(implies(X0,implies(implies(X1,X2),implies(X2,X3))),implies(X4,implies(X5,implies(X6,X2)))))
      | is_a_theorem(implies(X7,implies(X8,implies(X4,implies(X5,implies(X6,X2)))))) ),
    inference(resolution,[],[f48,f1]) ).

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

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

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

fof(f664,plain,
    ( ! [X2,X3,X1,X4,X5] : is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),implies(X4,implies(implies(X5,X2),X2)))))
    | ~ spl0_11 ),
    inference(avatar_component_clause,[],[f663]) ).

fof(f665,plain,
    ( spl0_11
    | spl0_2 ),
    inference(avatar_split_clause,[],[f650,f16,f663]) ).

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

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

fof(f838,plain,
    ( ! [X2,X3,X1,X4] : is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,implies(implies(X4,X1),X1))))
    | ~ spl0_13 ),
    inference(avatar_component_clause,[],[f837]) ).

fof(f839,plain,
    ( spl0_13
    | spl0_2
    | ~ spl0_11 ),
    inference(avatar_split_clause,[],[f823,f663,f16,f837]) ).

fof(f864,plain,
    ( ! [X2,X3,X0,X1] :
        ( ~ is_a_theorem(implies(implies(X0,X1),X0))
        | is_a_theorem(implies(X2,implies(implies(X3,X0),X0))) )
    | ~ spl0_13 ),
    inference(resolution,[],[f838,f1]) ).

fof(f885,plain,
    ( ! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(implies(X1,implies(X2,implies(X3,X3))),implies(X2,implies(X3,X3)))))
    | ~ spl0_4
    | ~ spl0_13 ),
    inference(resolution,[],[f864,f63]) ).

fof(f1235,plain,
    ( ! [X2,X3,X0,X1] :
        ( ~ is_a_theorem(X0)
        | is_a_theorem(implies(implies(X1,implies(X2,implies(X3,X3))),implies(X2,implies(X3,X3)))) )
    | ~ spl0_4
    | ~ spl0_13 ),
    inference(resolution,[],[f885,f1]) ).

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

fof(f1252,plain,
    ( ! [X2,X3,X1] : is_a_theorem(implies(implies(X1,implies(X2,implies(X3,X3))),implies(X2,implies(X3,X3))))
    | ~ spl0_16 ),
    inference(avatar_component_clause,[],[f1251]) ).

fof(f1253,plain,
    ( spl0_16
    | spl0_2
    | ~ spl0_4
    | ~ spl0_13 ),
    inference(avatar_split_clause,[],[f1235,f837,f57,f16,f1251]) ).

fof(f1279,plain,
    ( ! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,X0),X1),implies(X2,implies(X3,X1))))
    | ~ spl0_16 ),
    inference(resolution,[],[f1252,f4]) ).

fof(f1280,plain,
    ( ! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(implies(X2,X3),implies(X3,X3)))))
    | ~ spl0_16 ),
    inference(resolution,[],[f1252,f50]) ).

fof(f1461,plain,
    ( ! [X2,X3,X0,X1] :
        ( ~ is_a_theorem(implies(implies(X0,X0),X1))
        | is_a_theorem(implies(X2,implies(X3,X1))) )
    | ~ spl0_16 ),
    inference(resolution,[],[f1279,f1]) ).

fof(f1513,plain,
    ( ! [X2,X3,X0,X1] :
        ( ~ is_a_theorem(X0)
        | is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X3,X3)))) )
    | ~ spl0_16 ),
    inference(resolution,[],[f1280,f1]) ).

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

fof(f1532,plain,
    ( ! [X2,X3,X1] : is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X3,X3))))
    | ~ spl0_22 ),
    inference(avatar_component_clause,[],[f1531]) ).

fof(f1533,plain,
    ( spl0_22
    | spl0_2
    | ~ spl0_16 ),
    inference(avatar_split_clause,[],[f1513,f1251,f16,f1531]) ).

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

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

fof(f1578,plain,
    ( ! [X2,X1] : is_a_theorem(implies(implies(X1,X2),implies(X2,X2)))
    | ~ spl0_23 ),
    inference(avatar_component_clause,[],[f1577]) ).

fof(f1579,plain,
    ( spl0_23
    | spl0_2
    | ~ spl0_22 ),
    inference(avatar_split_clause,[],[f1560,f1531,f16,f1577]) ).

fof(f1935,plain,
    ( ! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X2))))
    | ~ spl0_16
    | ~ spl0_23 ),
    inference(resolution,[],[f1461,f1578]) ).

fof(f2045,plain,
    ( ! [X2,X0,X1] :
        ( ~ is_a_theorem(X0)
        | is_a_theorem(implies(X1,implies(X2,X2))) )
    | ~ spl0_16
    | ~ spl0_23 ),
    inference(resolution,[],[f1935,f1]) ).

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

fof(f2066,plain,
    ( ! [X2,X1] : is_a_theorem(implies(X1,implies(X2,X2)))
    | ~ spl0_27 ),
    inference(avatar_component_clause,[],[f2065]) ).

fof(f2067,plain,
    ( spl0_27
    | spl0_2
    | ~ spl0_16
    | ~ spl0_23 ),
    inference(avatar_split_clause,[],[f2045,f1577,f1251,f16,f2065]) ).

fof(f2091,plain,
    ( ! [X0,X1] :
        ( ~ is_a_theorem(X0)
        | is_a_theorem(implies(X1,X1)) )
    | ~ spl0_27 ),
    inference(resolution,[],[f2066,f1]) ).

fof(f2110,definition,
    ( spl0_28
  <=> ! [X1] : is_a_theorem(implies(X1,X1)) ),
    introduced(definition,[new_symbols(definition,[spl0_28])],[avatar_definition]) ).

fof(f2111,plain,
    ( ! [X1] : is_a_theorem(implies(X1,X1))
    | ~ spl0_28 ),
    inference(avatar_component_clause,[],[f2110]) ).

fof(f2112,plain,
    ( spl0_28
    | spl0_2
    | ~ spl0_27 ),
    inference(avatar_split_clause,[],[f2091,f2065,f16,f2110]) ).

fof(f2170,plain,
    ( $false
    | ~ spl0_28 ),
    inference(resolution,[],[f2111,f3]) ).

fof(f2193,plain,
    ~ spl0_28,
    inference(avatar_contradiction_clause,[],[f2170]) ).

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

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

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

cnf(s12,plain,
    ( spl0_2
    | spl0_11 ),
    inference(sat_conversion,[],[f665]) ).

cnf(s14,plain,
    ( spl0_2
    | ~ spl0_11
    | spl0_13 ),
    inference(sat_conversion,[],[f839]) ).

cnf(s17,plain,
    ( spl0_2
    | ~ spl0_4
    | ~ spl0_13
    | spl0_16 ),
    inference(sat_conversion,[],[f1253]) ).

cnf(s23,plain,
    ( spl0_2
    | ~ spl0_16
    | spl0_22 ),
    inference(sat_conversion,[],[f1533]) ).

cnf(s24,plain,
    ( spl0_2
    | ~ spl0_22
    | spl0_23 ),
    inference(sat_conversion,[],[f1579]) ).

cnf(s28,plain,
    ( spl0_2
    | ~ spl0_16
    | ~ spl0_23
    | spl0_27 ),
    inference(sat_conversion,[],[f2067]) ).

cnf(s29,plain,
    ( spl0_2
    | ~ spl0_27
    | spl0_28 ),
    inference(sat_conversion,[],[f2112]) ).

cnf(s30,plain,
    ~ spl0_28,
    inference(sat_conversion,[],[f2193]) ).

cnf(s31,plain,
    ( spl0_2
    | ~ spl0_27 ),
    inference(rat,[],[s29,s30]) ).

cnf(s32,plain,
    ~ spl0_27,
    inference(rat,[],[s31,s3]) ).

cnf(s39,plain,
    spl0_11,
    inference(rat,[],[s12,s3]) ).

cnf(s42,plain,
    spl0_13,
    inference(rat,[],[s14,s3,s39]) ).

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

cnf(s47,plain,
    spl0_4,
    inference(rat,[],[s5,s3,s46]) ).

cnf(s48,plain,
    spl0_16,
    inference(rat,[],[s17,s42,s3,s47]) ).

cnf(s52,plain,
    ~ spl0_23,
    inference(rat,[],[s28,s32,s3,s48]) ).

cnf(s53,plain,
    spl0_22,
    inference(rat,[],[s23,s3,s48]) ).

cnf(s56,plain,
    $false,
    inference(rat,[],[s24,s3,s52,s53]) ).

fof(f2194,plain,
    $false,
    inference(avatar_sat_refutation,[],[s56]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL090-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38  % Computer : n007.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Sun Sep 27 15:19:24 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42  Running first-order theorem proving
% 0.10/0.42  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.06/1.48  % (1575473)Input is clausal, will run a generic CNF schedule.
% 3.06/1.48  % (1575513)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3385108293:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.06/1.48  % (1575513)Instruction limit reached! 
% 3.06/1.48  % (1575513)------------------------------
% 3.06/1.48  % (1575513)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.06/1.48  % (1575513)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.06/1.48  % (1575513)CaDiCaL version: 2.1.3
% 3.06/1.48  % (1575513)Termination reason: Instruction limit
% 3.06/1.48  % (1575513)Termination phase: Saturation
% 3.06/1.48  % (1575513)Time elapsed: 0.039 s
% 3.06/1.48  % (1575513)Peak memory usage: 89 MB
% 3.06/1.48  % (1575513)Instructions burned: 115 (million)
% 3.06/1.48  % (1575514)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3377282283:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.06/1.48  % (1575509)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=3520415677:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.06/1.48  % (1575515)dis-21_1_sil=8000:lcm=predicate:random_seed=384165350: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.06/1.48  % (1575511)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=555297103:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.06/1.48  % (1575510)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3290354527:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.06/1.48  % (1575512)lrs+10_1_sil=8000:sp=occurrence:random_seed=2868414043:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.06/1.48  % (1575512)First to succeed.
% 3.06/1.48  % (1575512)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1575473"
% 3.06/1.48  % (1575515)Instruction limit reached! 
% 3.06/1.48  % (1575515)------------------------------
% 3.06/1.48  % (1575515)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.06/1.48  % (1575515)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.06/1.48  % (1575515)CaDiCaL version: 2.1.3
% 3.06/1.48  % (1575515)Termination reason: Instruction limit
% 3.06/1.48  % (1575515)Termination phase: Saturation
% 3.06/1.48  % (1575515)Time elapsed: 0.067 s
% 3.06/1.48  % (1575515)Peak memory usage: 88 MB
% 3.06/1.48  % (1575515)Instructions burned: 118 (million)
% 3.06/1.48  % (1575514)Instruction limit reached! 
% 3.06/1.48  % (1575514)------------------------------
% 3.06/1.48  % (1575514)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.06/1.48  % (1575514)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.06/1.48  % (1575514)CaDiCaL version: 2.1.3
% 3.06/1.48  % (1575514)Termination reason: Instruction limit
% 3.06/1.48  % (1575514)Termination phase: Saturation
% 3.06/1.48  % (1575514)Time elapsed: 0.114 s
% 3.06/1.48  % (1575514)Peak memory usage: 89 MB
% 3.06/1.48  % (1575514)Instructions burned: 181 (million)
% 3.06/1.48  % (1575523)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=4065798787:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 3.06/1.48  % (1575523)Refutation not found, incomplete strategy
% 3.06/1.48  % (1575523)------------------------------
% 3.06/1.48  % (1575523)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.06/1.48  % (1575523)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.06/1.48  % (1575523)CaDiCaL version: 2.1.3
% 3.06/1.48  % (1575523)Termination reason: Refutation not found, incomplete strategy
% 3.06/1.48  % (1575523)Time elapsed: 0.0000 s
% 3.06/1.48  % (1575523)Peak memory usage: 87 MB
% 3.06/1.48  % (1575528)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=4229629121: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.06/1.48  % (1575548)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=1684731793:st=4:i=219:sd=3:ss=axioms_2996 on theBenchmark for (2996ds/219Mi)
% 3.06/1.48  % (1575548)Refutation not found, incomplete strategy
% 3.06/1.48  % (1575548)------------------------------
% 3.06/1.48  % (1575548)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.06/1.48  % (1575548)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.06/1.48  % (1575548)CaDiCaL version: 2.1.3
% 3.06/1.48  % (1575548)Termination reason: Refutation not found, incomplete strategy
% 3.06/1.48  % (1575548)Time elapsed: 0.001 s
% 3.06/1.48  % (1575548)Peak memory usage: 87 MB
% 3.06/1.48  % (1575523)------------------------------
% 3.06/1.48  % (1575523)------------------------------
% 3.06/1.48  % (1575512)Refutation found. Thanks to Tanya!
% 3.06/1.48  % SZS status Unsatisfiable for theBenchmark
% 3.06/1.48  % SZS output start Proof for theBenchmark
% See solution above
% 4.27/1.67  % (1575512)------------------------------
% 4.27/1.67  % (1575512)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.27/1.67  % (1575512)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.27/1.67  % (1575512)CaDiCaL version: 2.1.3
% 4.27/1.67  % (1575512)Termination reason: Refutation
% 4.27/1.67  % (1575512)Time elapsed: 0.052 s
% 4.27/1.67  % (1575512)Peak memory usage: 90 MB
% 4.27/1.67  % (1575512)Instructions burned: 78 (million)
% 4.27/1.67  % (1575512)------------------------------
% 4.27/1.67  % (1575512)------------------------------
% 4.27/1.67  % (1575473)Success in time 0.509 s
% 4.27/1.67  % Vampire exiting
%------------------------------------------------------------------------------