↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : LCL056-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% 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:57:31 AM UTC 2026

% Result   : Unsatisfiable 2.94s 0.92s
% Output   : Refutation 2.94s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   37
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   74 (  21 unt;   2 def)
%            Number of atoms       :  138 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  131 (  67   ~;  62   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    4 (   3 usr;   3 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :  165 (   0 sgn 165   !;   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,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_1) ).

fof(f3,axiom,
    ! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_2) ).

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

fof(f5,negated_conjecture,
    ~ is_a_theorem(implies(not(not(a)),a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_39) ).

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

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

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

fof(f29,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(X0,implies(not(X1),X1)))
      | is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[],[f28,f3]) ).

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

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

fof(f32,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(X0,implies(not(X1),X2)))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[],[f28,f4]) ).

fof(f34,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(implies(X0,X1),X1))
      | ~ is_a_theorem(implies(not(X1),X0)) ),
    inference(resolution,[],[f29,f27]) ).

fof(f35,plain,
    ! [X0] : is_a_theorem(implies(implies(not(implies(not(X0),X0)),implies(not(X0),X0)),X0)),
    inference(resolution,[],[f29,f3]) ).

fof(f43,plain,
    ! [X2,X3,X0,X1] :
      ( ~ is_a_theorem(implies(X2,X0))
      | ~ is_a_theorem(implies(X0,X1))
      | is_a_theorem(implies(X2,implies(not(X1),X3))) ),
    inference(resolution,[],[f32,f28]) ).

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

fof(f56,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(not(implies(not(X0),X1)),X2))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f44,f4]) ).

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

fof(f210,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(implies(not(X0),X0),implies(not(X1),X2)))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[],[f43,f3]) ).

fof(f226,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(implies(not(X0),X0),X1))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[],[f210,f29]) ).

fof(f239,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(not(X0),X0))
      | ~ is_a_theorem(implies(X0,X1))
      | is_a_theorem(X1) ),
    inference(resolution,[],[f226,f1]) ).

fof(f245,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(implies(not(X0),X1),X2))
      | is_a_theorem(X2)
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f239,f56]) ).

fof(f252,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(implies(X0,X1),implies(not(X2),X1)))
      | ~ is_a_theorem(X2) ),
    inference(resolution,[],[f245,f2]) ).

fof(f265,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(implies(X1,X0),X0))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f252,f29]) ).

fof(f278,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X1,implies(X2,X0)))
      | ~ is_a_theorem(X0)
      | is_a_theorem(implies(X1,X0)) ),
    inference(resolution,[],[f265,f28]) ).

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

fof(f321,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(not(X0),X0))
      | is_a_theorem(implies(X1,X0)) ),
    inference(resolution,[],[f293,f29]) ).

fof(f358,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(X1)
      | is_a_theorem(implies(X0,implies(not(X1),X2))) ),
    inference(resolution,[],[f321,f56]) ).

fof(f373,plain,
    ! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(not(implies(X1,implies(not(X1),X2))),X3))),
    inference(resolution,[],[f358,f4]) ).

fof(f377,plain,
    ! [X2,X3,X0,X1] :
      ( is_a_theorem(implies(X0,implies(not(implies(X1,X2)),X3)))
      | ~ is_a_theorem(X2) ),
    inference(resolution,[],[f358,f293]) ).

fof(f406,definition,
    ( spl0_8
  <=> ! [X2] : ~ is_a_theorem(X2) ),
    introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).

fof(f407,plain,
    ( ! [X2] : ~ is_a_theorem(X2)
    | ~ spl0_8 ),
    inference(avatar_component_clause,[],[f406]) ).

fof(f421,plain,
    ( $false
    | ~ spl0_8 ),
    inference(resolution,[],[f407,f3]) ).

fof(f432,plain,
    ~ spl0_8,
    inference(avatar_contradiction_clause,[],[f421]) ).

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

fof(f653,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(implies(X1,X0),X2))
      | ~ is_a_theorem(X0)
      | is_a_theorem(X2) ),
    inference(resolution,[],[f636,f239]) ).

fof(f695,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(implies(X0,X1),implies(X2,X1)))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f653,f2]) ).

fof(f712,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(implies(X0,X1),X1))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f695,f29]) ).

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

fof(f1110,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X0,implies(X1,X2)))
      | is_a_theorem(implies(X0,X2))
      | ~ is_a_theorem(X1) ),
    inference(resolution,[],[f28,f712]) ).

fof(f1310,plain,
    ! [X2,X3,X0,X1] :
      ( ~ is_a_theorem(implies(X0,implies(implies(not(X1),X3),X2)))
      | is_a_theorem(implies(X0,implies(X1,X2))) ),
    inference(resolution,[],[f31,f4]) ).

fof(f1380,plain,
    ! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(not(X1),X2)))),
    inference(resolution,[],[f373,f29]) ).

fof(f1407,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(implies(X0,implies(not(X0),X1)),X2))
      | is_a_theorem(X2) ),
    inference(resolution,[],[f1380,f239]) ).

fof(f1465,plain,
    ! [X2,X0,X1] : is_a_theorem(implies(implies(implies(not(X0),X1),X2),implies(X0,X2))),
    inference(resolution,[],[f1407,f2]) ).

fof(f1509,plain,
    ! [X2,X3,X0,X1] :
      ( ~ is_a_theorem(implies(implies(not(X0),X1),X2))
      | is_a_theorem(implies(X3,implies(X0,X2))) ),
    inference(resolution,[],[f1465,f714]) ).

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

fof(f1551,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(not(X1),not(X0)))
      | is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[],[f1511,f34]) ).

fof(f2237,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(implies(X0,X1),implies(X0,X2)))
      | ~ is_a_theorem(implies(X1,X2)) ),
    inference(resolution,[],[f1110,f2]) ).

fof(f8247,plain,
    ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,not(X1)),implies(X1,implies(X0,X2)))),
    inference(resolution,[],[f1310,f2]) ).

fof(f8408,plain,
    ! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,implies(not(X1),X3))))),
    inference(resolution,[],[f8247,f1509]) ).

fof(f8421,plain,
    ! [X0,X1] : is_a_theorem(implies(implies(X0,not(not(implies(X0,X1)))),implies(X0,X1))),
    inference(resolution,[],[f8247,f29]) ).

fof(f8443,plain,
    ! [X2,X3,X0,X1] :
      ( ~ is_a_theorem(implies(implies(X0,implies(X1,implies(not(X0),X2))),X3))
      | is_a_theorem(X3) ),
    inference(resolution,[],[f8408,f239]) ).

fof(f8745,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(implies(X0,not(not(implies(X0,X1)))),X1))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f8421,f1110]) ).

fof(f12913,plain,
    ! [X2,X3,X0,X1] :
      ( ~ is_a_theorem(implies(implies(X2,implies(not(X0),X3)),X1))
      | is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[],[f8443,f2237]) ).

fof(f17235,plain,
    ! [X2,X3,X0,X1] :
      ( ~ is_a_theorem(implies(implies(not(X0),X3),X2))
      | is_a_theorem(implies(X0,implies(X1,X2))) ),
    inference(resolution,[],[f12913,f2237]) ).

fof(f19444,plain,
    ! [X0,X1] : is_a_theorem(implies(implies(not(X0),X0),implies(X1,X0))),
    inference(resolution,[],[f17235,f35]) ).

fof(f19655,plain,
    ! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X1)))),
    inference(resolution,[],[f19444,f1509]) ).

fof(f19779,plain,
    ! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,X2))),
    inference(resolution,[],[f19655,f177]) ).

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

fof(f20751,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(not(not(implies(X0,X1))),X1))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f20316,f8745]) ).

fof(f21020,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(X1,not(implies(X0,not(X1)))))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f20751,f1551]) ).

fof(f21483,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(implies(X0,not(not(X1))),X1))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f21020,f1551]) ).

fof(f21861,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(X0)
      | is_a_theorem(implies(not(not(X1)),X1)) ),
    inference(resolution,[],[f21483,f20316]) ).

fof(f21936,definition,
    ( spl0_594
  <=> ! [X1] : is_a_theorem(implies(not(not(X1)),X1)) ),
    introduced(definition,[new_symbols(definition,[spl0_594])],[avatar_definition]) ).

fof(f21937,plain,
    ( ! [X1] : is_a_theorem(implies(not(not(X1)),X1))
    | ~ spl0_594 ),
    inference(avatar_component_clause,[],[f21936]) ).

fof(f21938,plain,
    ( spl0_594
    | spl0_8 ),
    inference(avatar_split_clause,[],[f21861,f406,f21936]) ).

fof(f21956,plain,
    ( $false
    | ~ spl0_594 ),
    inference(resolution,[],[f21937,f5]) ).

fof(f22001,plain,
    ~ spl0_594,
    inference(avatar_contradiction_clause,[],[f21956]) ).

cnf(s20,plain,
    ~ spl0_8,
    inference(sat_conversion,[],[f432]) ).

cnf(s1051,plain,
    ( spl0_8
    | spl0_594 ),
    inference(sat_conversion,[],[f21938]) ).

cnf(s1052,plain,
    ~ spl0_594,
    inference(sat_conversion,[],[f22001]) ).

cnf(s1053,plain,
    spl0_8,
    inference(rat,[],[s1051,s1052]) ).

cnf(s1054,plain,
    $false,
    inference(rat,[],[s20,s1053]) ).

fof(f22002,plain,
    $false,
    inference(avatar_sat_refutation,[],[s1054]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL056-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37  % Computer : n011.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sun Sep 27 15:20:00 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40  Running first-order model finding
% 0.10/0.40  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.94/0.92  % (2540682)Will run a generic schedule for satisfiability detection.
% 2.94/0.92  % (2540687)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1060143317_2999 on theBenchmark for (2999ds/0Mi)
% 2.94/0.92  % TRYING [1]
% 2.94/0.92  % TRYING [2]
% 2.94/0.92  % TRYING [3]
% 2.94/0.92  % TRYING [4]
% 2.94/0.92  % (2540689)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3945320619:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.94/0.92  % (2540690)dis+10_1_sil=32000:sp=arity:random_seed=2134921739:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.94/0.92  % (2540691)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2715502570:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.94/0.92  % (2540692)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2501073055:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.94/0.92  % (2540693)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1452516906:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.94/0.92  % (2540688)% WARNING: option uhcvi not known.
% 2.94/0.92  % TRYING [5]
% 2.94/0.92  % (2540688)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=149379431:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.94/0.92  % (2540690)Instruction limit reached! 
% 2.94/0.92  % (2540690)------------------------------
% 2.94/0.92  % (2540690)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.94/0.92  % (2540690)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.94/0.92  % (2540690)CaDiCaL version: 2.1.3
% 2.94/0.92  % (2540690)Termination reason: Instruction limit
% 2.94/0.92  % (2540690)Termination phase: Saturation
% 2.94/0.92  % (2540690)Time elapsed: 0.066 s
% 2.94/0.92  % (2540690)Peak memory usage: 11 MB
% 2.94/0.92  % (2540690)Instructions burned: 104 (million)
% 2.94/0.92  % (2540691)Instruction limit reached! 
% 2.94/0.92  % (2540691)------------------------------
% 2.94/0.92  % (2540691)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.94/0.92  % (2540691)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.94/0.92  % (2540691)CaDiCaL version: 2.1.3
% 2.94/0.92  % (2540691)Termination reason: Instruction limit
% 2.94/0.92  % (2540691)Termination phase: Saturation
% 2.94/0.92  % (2540691)Time elapsed: 0.072 s
% 2.94/0.92  % (2540691)Peak memory usage: 11 MB
% 2.94/0.92  % (2540691)Instructions burned: 116 (million)
% 2.94/0.92  % (2540692)Instruction limit reached! 
% 2.94/0.92  % (2540692)------------------------------
% 2.94/0.92  % (2540692)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.94/0.92  % (2540692)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.94/0.92  % (2540692)CaDiCaL version: 2.1.3
% 2.94/0.92  % (2540692)Termination reason: Instruction limit
% 2.94/0.92  % (2540692)Termination phase: Saturation
% 2.94/0.92  % (2540692)Time elapsed: 0.083 s
% 2.94/0.92  % (2540692)Peak memory usage: 13 MB
% 2.94/0.92  % (2540692)Instructions burned: 131 (million)
% 2.94/0.92  % (2540701)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2658740521:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.94/0.92  % TRYING [1]
% 2.94/0.92  % TRYING [2]
% 2.94/0.92  % TRYING [3]
% 2.94/0.92  % TRYING [6]
% 2.94/0.92  % TRYING [4]
% 2.94/0.92  % (2540702)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=634657634:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.94/0.92  % (2540693)Instruction limit reached! 
% 2.94/0.92  % (2540693)------------------------------
% 2.94/0.92  % (2540693)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.94/0.92  % (2540693)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.94/0.92  % (2540693)CaDiCaL version: 2.1.3
% 2.94/0.92  % (2540693)Termination reason: Instruction limit
% 2.94/0.92  % (2540693)Termination phase: Saturation
% 2.94/0.92  % (2540693)Time elapsed: 0.097 s
% 2.94/0.92  % (2540693)Peak memory usage: 12 MB
% 2.94/0.92  % (2540693)Instructions burned: 159 (million)
% 2.94/0.92  % (2540703)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=2095916929:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.94/0.92  % TRYING [5]
% 2.94/0.92  % (2540706)ott-21_1_sil=16000:fs=off:random_seed=1292164030:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.94/0.92  % (2540702)Instruction limit reached! 
% 2.94/0.92  % (2540702)------------------------------
% 2.94/0.92  % (2540702)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.94/0.92  % (2540702)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.94/0.92  % (2540702)CaDiCaL version: 2.1.3
% 2.94/0.92  % (2540702)Termination reason: Instruction limit
% 2.94/0.92  % (2540702)Termination phase: Saturation
% 2.94/0.92  % (2540702)Time elapsed: 0.079 s
% 2.94/0.92  % (2540702)Peak memory usage: 12 MB
% 2.94/0.92  % (2540702)Instructions burned: 132 (million)
% 2.94/0.92  % (2540709)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=151651109:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.94/0.92  % (2540706)Instruction limit reached! 
% 2.94/0.92  % (2540706)------------------------------
% 2.94/0.92  % (2540706)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.94/0.92  % (2540706)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.94/0.92  % (2540706)CaDiCaL version: 2.1.3
% 2.94/0.92  % (2540706)Termination reason: Instruction limit
% 2.94/0.92  % (2540706)Termination phase: Saturation
% 2.94/0.92  % (2540706)Time elapsed: 0.094 s
% 2.94/0.92  % (2540706)Peak memory usage: 12 MB
% 2.94/0.92  % (2540706)Instructions burned: 181 (million)
% 2.94/0.92  % TRYING [6]
% 2.94/0.92  % (2540711)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3791407468:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.94/0.92  % TRYING [1]
% 2.94/0.92  % TRYING [2]
% 2.94/0.92  % TRYING [3]
% 2.94/0.92  % TRYING [4]
% 2.94/0.92  % TRYING [5]
% 2.94/0.92  % TRYING [6]
% 2.94/0.92  % (2540703) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2540682-2540703"...
% 2.94/0.92  % (2540703)...printing done.
% 2.94/0.92  % (2540703)Refutation found. Thanks to Tanya!
% 2.94/0.92  % SZS status Unsatisfiable for theBenchmark
% 2.94/0.92  % SZS output start Proof for theBenchmark
% See solution above
% 2.94/0.92  % (2540703)------------------------------
% 2.94/0.92  % (2540703)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.94/0.92  % (2540703)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.94/0.92  % (2540703)CaDiCaL version: 2.1.3
% 2.94/0.92  % (2540703)Termination reason: Refutation
% 2.94/0.92  % (2540703)Time elapsed: 0.370 s
% 2.94/0.92  % (2540703)Peak memory usage: 17 MB
% 2.94/0.92  % (2540703)Instructions burned: 627 (million)
% 2.94/0.92  % (2540682)Success in time 0.509 s
% 2.94/0.92  % Vampire exiting
%------------------------------------------------------------------------------