↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL347-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n003.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:52:03 AM UTC 2026

% Result   : Unsatisfiable 9.69s 2.28s
% Output   : Refutation 10.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   92 (  36 unt;   4 def)
%            Number of atoms       :  161 (   4 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  139 (  70   ~;  65   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :   10 (   2 avg)
%            Number of predicates  :    8 (   6 usr;   5 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-2 aty)
%            Number of variables   :  148 (   0 sgn 148   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : axiom(implies(or(X0,X0),X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).

fof(f2,axiom,
    ! [X0,X1] : axiom(implies(X0,or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).

fof(f3,axiom,
    ! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).

fof(f4,axiom,
    ! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_5) ).

fof(f5,axiom,
    ! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_6) ).

fof(f6,axiom,
    ! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).

fof(f7,axiom,
    ! [X0] :
      ( ~ axiom(X0)
      | theorem(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( theorem(X0)
      | ~ theorem(implies(X1,X0))
      | ~ theorem(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).

fof(f9,axiom,
    ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_defn) ).

fof(f10,axiom,
    ! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',equivalent_defn) ).

fof(f11,negated_conjecture,
    ~ theorem(equivalent(and(or(p,q),not(q)),and(p,not(q)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f12,plain,
    ! [X0,X1] : equivalent(X0,X1) = not(or(not(or(not(X0),X1)),not(or(not(X1),X0)))),
    inference(definition_unfolding,[],[f10,f9,f6,f6]) ).

fof(f13,plain,
    ~ theorem(not(or(not(or(not(not(or(not(or(p,q)),not(not(q))))),not(or(not(p),not(not(q)))))),not(or(not(not(or(not(p),not(not(q))))),not(or(not(or(p,q)),not(not(q))))))))),
    inference(definition_unfolding,[],[f11,f12,f9,f9]) ).

fof(f14,plain,
    ! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(definition_unfolding,[],[f5,f6,f6,f6]) ).

fof(f15,plain,
    ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(definition_unfolding,[],[f4,f6]) ).

fof(f16,plain,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    inference(definition_unfolding,[],[f3,f6]) ).

fof(f17,plain,
    ! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
    inference(definition_unfolding,[],[f2,f6]) ).

fof(f18,plain,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    inference(definition_unfolding,[],[f1,f6]) ).

fof(f19,plain,
    ! [X0,X1] :
      ( ~ theorem(or(not(X1),X0))
      | theorem(X0)
      | ~ theorem(X1) ),
    inference(definition_unfolding,[],[f8,f6]) ).

fof(f20,plain,
    ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
    inference(resolution,[],[f16,f7]) ).

fof(f21,plain,
    ! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(resolution,[],[f14,f7]) ).

fof(f22,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(resolution,[],[f15,f7]) ).

fof(f23,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
    inference(resolution,[],[f17,f7]) ).

fof(f24,plain,
    ! [X0] : theorem(or(not(or(X0,X0)),X0)),
    inference(resolution,[],[f18,f7]) ).

fof(f25,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,X0))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f19,f20]) ).

fof(f28,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X1,or(X0,X2)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f22,f19]) ).

fof(f29,plain,
    ! [X0,X1] : theorem(or(X0,or(not(or(X1,X0)),X1))),
    inference(resolution,[],[f28,f20]) ).

fof(f30,plain,
    ! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
    inference(resolution,[],[f28,f23]) ).

fof(f33,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X1)),or(X0,X2)))
      | ~ theorem(or(not(X1),X2)) ),
    inference(resolution,[],[f21,f19]) ).

fof(f34,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))),
    inference(resolution,[],[f21,f28]) ).

fof(f35,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(not(X0),X1))
      | theorem(or(X2,X1))
      | ~ theorem(or(X2,X0)) ),
    inference(resolution,[],[f33,f19]) ).

fof(f43,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X0,or(X2,X1)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f35,f20]) ).

fof(f46,plain,
    ! [X2,X3,X0,X1] :
      ( theorem(or(X0,or(not(or(X1,X2)),or(X1,X3))))
      | ~ theorem(or(X0,or(not(X2),X3))) ),
    inference(resolution,[],[f35,f21]) ).

fof(f47,plain,
    ! [X2,X3,X0,X1] :
      ( ~ theorem(or(X0,or(X1,X3)))
      | theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(not(X3),X2)) ),
    inference(resolution,[],[f35,f33]) ).

fof(f48,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X0,or(X1,X1)))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f35,f24]) ).

fof(f50,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
    inference(resolution,[],[f43,f23]) ).

fof(f64,plain,
    ! [X0] : theorem(or(not(X0),X0)),
    inference(resolution,[],[f48,f50]) ).

fof(f71,plain,
    ! [X0] : theorem(or(X0,not(X0))),
    inference(resolution,[],[f64,f25]) ).

fof(f72,plain,
    ! [X0,X1] :
      ( theorem(or(X0,not(not(X1))))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f71,f35]) ).

fof(f76,plain,
    ! [X0,X1] :
      ( theorem(or(not(or(X0,not(X1))),X0))
      | ~ theorem(X1) ),
    inference(resolution,[],[f29,f19]) ).

fof(f81,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(not(X0),X1)),or(X2,X1)))
      | ~ theorem(or(X2,X0)) ),
    inference(resolution,[],[f34,f19]) ).

fof(f91,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,not(X0)))
      | theorem(X1)
      | ~ theorem(X0) ),
    inference(resolution,[],[f76,f19]) ).

fof(f96,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X1)),or(X1,X2)))
      | ~ theorem(or(not(X0),X2)) ),
    inference(resolution,[],[f47,f20]) ).

fof(f98,plain,
    ! [X2,X3,X0,X1] :
      ( theorem(or(not(or(X0,or(X1,X2))),or(X1,X3)))
      | ~ theorem(or(not(or(X0,X2)),X3)) ),
    inference(resolution,[],[f47,f22]) ).

fof(f99,plain,
    ! [X2,X3,X0,X1] :
      ( theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),X3)))
      | ~ theorem(or(not(or(X2,X1)),X3)) ),
    inference(resolution,[],[f47,f21]) ).

fof(f109,plain,
    ! [X2,X3,X0,X1] :
      ( ~ theorem(or(not(or(X0,X1)),X2))
      | theorem(or(not(or(X0,X3)),X2))
      | ~ theorem(or(not(X3),X1)) ),
    inference(resolution,[],[f99,f19]) ).

fof(f130,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(not(X0),X1))
      | theorem(or(X2,X1))
      | ~ theorem(or(X0,X2)) ),
    inference(resolution,[],[f96,f19]) ).

fof(f135,plain,
    ! [X0,X1] :
      ( theorem(or(not(or(X0,X1)),X1))
      | ~ theorem(or(not(X0),X1)) ),
    inference(resolution,[],[f96,f48]) ).

fof(f139,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X2)),X1))
      | ~ theorem(or(not(X0),X1))
      | ~ theorem(or(not(X2),X1)) ),
    inference(resolution,[],[f135,f109]) ).

fof(f156,plain,
    ! [X0,X1] :
      ( theorem(or(not(not(X1)),X0))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f72,f25]) ).

fof(f176,plain,
    ! [X0,X1] : theorem(or(X0,or(X1,not(X1)))),
    inference(resolution,[],[f30,f43]) ).

fof(f210,plain,
    ! [X0,X1] :
      ( theorem(not(or(not(X0),not(X1))))
      | ~ theorem(X0)
      | ~ theorem(X1) ),
    inference(resolution,[],[f91,f76]) ).

fof(f217,plain,
    ( ~ theorem(or(not(not(or(not(or(p,q)),not(not(q))))),not(or(not(p),not(not(q))))))
    | ~ theorem(or(not(not(or(not(p),not(not(q))))),not(or(not(or(p,q)),not(not(q)))))) ),
    inference(resolution,[],[f210,f13]) ).

fof(f219,definition,
    ( spl0_1
  <=> theorem(or(not(not(or(not(p),not(not(q))))),not(or(not(or(p,q)),not(not(q)))))) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f221,plain,
    ( ~ theorem(or(not(not(or(not(p),not(not(q))))),not(or(not(or(p,q)),not(not(q))))))
    | spl0_1 ),
    inference(avatar_component_clause,[],[f219]) ).

fof(f223,definition,
    ( spl0_2
  <=> theorem(or(not(not(or(not(or(p,q)),not(not(q))))),not(or(not(p),not(not(q)))))) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f225,plain,
    ( ~ theorem(or(not(not(or(not(or(p,q)),not(not(q))))),not(or(not(p),not(not(q))))))
    | spl0_2 ),
    inference(avatar_component_clause,[],[f223]) ).

fof(f226,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f217,f223,f219]) ).

fof(f227,plain,
    ( ~ theorem(or(not(or(not(or(p,q)),not(not(q)))),or(not(p),not(not(q)))))
    | spl0_1 ),
    inference(resolution,[],[f221,f156]) ).

fof(f228,plain,
    ( ~ theorem(or(not(p),or(p,q)))
    | spl0_1 ),
    inference(resolution,[],[f227,f81]) ).

fof(f230,plain,
    ( $false
    | spl0_1 ),
    inference(forward_subsumption_resolution,[],[f228,f50]) ).

fof(f231,plain,
    spl0_1,
    inference(avatar_contradiction_clause,[],[f230]) ).

fof(f254,plain,
    ( ~ theorem(or(not(or(not(p),not(not(q)))),or(not(or(p,q)),not(not(q)))))
    | spl0_2 ),
    inference(resolution,[],[f225,f156]) ).

fof(f287,plain,
    ! [X2,X3,X0,X1] :
      ( ~ theorem(or(not(or(X0,X1)),X2))
      | theorem(or(X3,X2))
      | ~ theorem(or(X0,or(X3,X1))) ),
    inference(resolution,[],[f98,f19]) ).

fof(f302,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X2,or(X0,X1)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f287,f20]) ).

fof(f471,plain,
    ! [X0,X1] :
      ( theorem(or(X0,not(not(X1))))
      | ~ theorem(or(X1,X0)) ),
    inference(resolution,[],[f130,f71]) ).

fof(f503,plain,
    ! [X0,X1] :
      ( theorem(or(not(not(X0)),X1))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f471,f25]) ).

fof(f509,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(not(X0)),or(X2,X1)))
      | ~ theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f503,f43]) ).

fof(f634,plain,
    ! [X2,X3,X0,X1] :
      ( ~ theorem(or(not(X0),or(not(X1),X2)))
      | theorem(or(not(or(X3,X1)),or(X3,X2)))
      | ~ theorem(X0) ),
    inference(resolution,[],[f46,f19]) ).

fof(f675,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X1)),or(X0,not(not(X1)))))
      | ~ theorem(X2) ),
    inference(resolution,[],[f634,f176]) ).

fof(f681,definition,
    ( spl0_13
  <=> ! [X2] : ~ theorem(X2) ),
    introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).

fof(f682,plain,
    ( ! [X2] : ~ theorem(X2)
    | ~ spl0_13 ),
    inference(avatar_component_clause,[],[f681]) ).

fof(f684,definition,
    ( spl0_14
  <=> ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X0,not(not(X1))))) ),
    introduced(definition,[new_symbols(definition,[spl0_14])],[avatar_definition]) ).

fof(f685,plain,
    ( ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X0,not(not(X1)))))
    | ~ spl0_14 ),
    inference(avatar_component_clause,[],[f684]) ).

fof(f686,plain,
    ( spl0_13
    | spl0_14 ),
    inference(avatar_split_clause,[],[f675,f684,f681]) ).

fof(f687,plain,
    ( $false
    | ~ spl0_13 ),
    inference(resolution,[],[f682,f24]) ).

fof(f764,plain,
    ~ spl0_13,
    inference(avatar_contradiction_clause,[],[f687]) ).

fof(f772,plain,
    ( ! [X0,X1] : theorem(or(X0,or(not(not(X1)),not(or(X0,X1)))))
    | ~ spl0_14 ),
    inference(resolution,[],[f685,f302]) ).

fof(f996,plain,
    ( ~ theorem(or(not(not(p)),or(not(or(p,q)),not(not(q)))))
    | ~ theorem(or(not(not(not(q))),or(not(or(p,q)),not(not(q)))))
    | spl0_2 ),
    inference(resolution,[],[f139,f254]) ).

fof(f1031,plain,
    ( ~ theorem(or(not(not(p)),or(not(or(p,q)),not(not(q)))))
    | spl0_2 ),
    inference(forward_subsumption_resolution,[],[f996,f23]) ).

fof(f1032,plain,
    ( ~ theorem(or(p,or(not(not(q)),not(or(p,q)))))
    | spl0_2 ),
    inference(resolution,[],[f1031,f509]) ).

fof(f1040,plain,
    ( $false
    | spl0_2
    | ~ spl0_14 ),
    inference(forward_subsumption_resolution,[],[f1032,f772]) ).

fof(f1041,plain,
    ( spl0_2
    | ~ spl0_14 ),
    inference(avatar_contradiction_clause,[],[f1040]) ).

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

cnf(s2,plain,
    spl0_1,
    inference(sat_conversion,[],[f231]) ).

cnf(s9,plain,
    ( spl0_13
    | spl0_14 ),
    inference(sat_conversion,[],[f686]) ).

cnf(s34,plain,
    ~ spl0_13,
    inference(sat_conversion,[],[f764]) ).

cnf(s39,plain,
    ( spl0_2
    | ~ spl0_14 ),
    inference(sat_conversion,[],[f1041]) ).

cnf(s41,plain,
    spl0_14,
    inference(rat,[],[s9,s34]) ).

cnf(s42,plain,
    spl0_2,
    inference(rat,[],[s39,s41]) ).

cnf(s43,plain,
    $false,
    inference(rat,[],[s1,s42,s2]) ).

fof(f1042,plain,
    $false,
    inference(avatar_sat_refutation,[],[s43]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL347-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.40  % Computer : n003.cluster.edu
% 0.12/0.40  % Model    : x86_64 x86_64
% 0.12/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40  % Memory   : 8046.5625MB
% 0.12/0.40  % OS       : Linux 6.8.0-71-generic
% 0.12/0.40  % CPULimit : 300
% 0.12/0.40  % WCLimit  : 300
% 0.12/0.40  % DateTime : Sun Sep 27 15:37:41 UTC 2026
% 0.12/0.40  % CPUTime  : 
% 0.12/0.40  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.44  Running first-order theorem proving
% 0.12/0.44  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
% 9.69/2.28  % (720920)Input is clausal, will run a generic CNF schedule.
% 9.69/2.28  % (720929)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=114861088:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 9.69/2.28  % (720925)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=3421964429:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 9.69/2.28  % (720928)lrs+10_1_sil=8000:sp=occurrence:random_seed=1138177638:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 9.69/2.28  % (720930)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=841340574:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 9.69/2.28  % (720931)dis-21_1_sil=8000:lcm=predicate:random_seed=4141627939: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)
% 9.69/2.28  % (720926)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=789637838:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 9.69/2.28  % (720927)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3708701927:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 9.69/2.28  % (720929)Instruction limit reached! 
% 9.69/2.28  % (720929)------------------------------
% 9.69/2.28  % (720929)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.69/2.28  % (720929)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.69/2.28  % (720929)CaDiCaL version: 2.1.3
% 9.69/2.28  % (720929)Termination reason: Instruction limit
% 9.69/2.28  % (720929)Termination phase: Saturation
% 9.69/2.28  % (720929)Time elapsed: 0.039 s
% 9.69/2.28  % (720929)Peak memory usage: 89 MB
% 9.69/2.28  % (720929)Instructions burned: 117 (million)
% 9.69/2.28  % (720931)Instruction limit reached! 
% 9.69/2.28  % (720931)------------------------------
% 9.69/2.28  % (720931)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.69/2.28  % (720931)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.69/2.28  % (720931)CaDiCaL version: 2.1.3
% 9.69/2.28  % (720931)Termination reason: Instruction limit
% 9.69/2.28  % (720931)Termination phase: Saturation
% 9.69/2.28  % (720931)Time elapsed: 0.057 s
% 9.69/2.28  % (720931)Peak memory usage: 87 MB
% 9.69/2.28  % (720931)Instructions burned: 117 (million)
% 9.69/2.28  % (720928)Instruction limit reached! 
% 9.69/2.28  % (720928)------------------------------
% 9.69/2.28  % (720928)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.69/2.28  % (720928)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.69/2.28  % (720928)CaDiCaL version: 2.1.3
% 9.69/2.28  % (720928)Termination reason: Instruction limit
% 9.69/2.28  % (720928)Termination phase: Saturation
% 9.69/2.28  % (720928)Time elapsed: 0.070 s
% 9.69/2.28  % (720928)Peak memory usage: 89 MB
% 9.69/2.28  % (720928)Instructions burned: 107 (million)
% 9.69/2.28  % (720930)Instruction limit reached! 
% 9.69/2.28  % (720930)------------------------------
% 9.69/2.28  % (720930)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.69/2.28  % (720930)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.69/2.28  % (720930)CaDiCaL version: 2.1.3
% 9.69/2.28  % (720930)Termination reason: Instruction limit
% 9.69/2.28  % (720930)Termination phase: Saturation
% 9.69/2.28  % (720930)Time elapsed: 0.114 s
% 9.69/2.28  % (720930)Peak memory usage: 89 MB
% 9.69/2.28  % (720930)Instructions burned: 181 (million)
% 9.69/2.28  % (720939)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=1812964714:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 9.69/2.28  % (720939)Refutation not found, incomplete strategy
% 9.69/2.28  % (720939)------------------------------
% 9.69/2.28  % (720939)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.69/2.28  % (720939)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.69/2.28  % (720939)CaDiCaL version: 2.1.3
% 9.69/2.28  % (720939)Termination reason: Refutation not found, incomplete strategy
% 9.69/2.28  % (720939)Time elapsed: 0.001 s
% 9.69/2.28  % (720939)Peak memory usage: 88 MB
% 9.69/2.28  % (720941)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=581126569:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 9.69/2.28  % (720940)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=2381593427: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)
% 9.69/2.28  % (720940)Refutation not found, incomplete strategy
% 9.69/2.28  % (720940)------------------------------
% 9.69/2.28  % (720940)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.69/2.28  % (720940)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.69/2.28  % (720940)CaDiCaL version: 2.1.3
% 9.69/2.28  % (720940)Termination reason: Refutation not found, incomplete strategy
% 9.69/2.28  % (720940)Time elapsed: 0.001 s
% 9.69/2.28  % (720940)Peak memory usage: 87 MB
% 9.69/2.28  % (720941)Refutation not found, incomplete strategy
% 9.69/2.28  % (720941)------------------------------
% 9.69/2.28  % (720941)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.69/2.28  % (720941)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.69/2.28  % (720941)CaDiCaL version: 2.1.3
% 9.69/2.28  % (720941)Termination reason: Refutation not found, incomplete strategy
% 9.69/2.28  % (720941)Time elapsed: 0.002 s
% 9.69/2.28  % (720941)Peak memory usage: 88 MB
% 9.69/2.28  % (720941)Instructions burned: 1 (million)
% 9.69/2.28  % (720939)------------------------------
% 9.69/2.28  % (720939)------------------------------
% 9.69/2.28  % (720942)lrs+10_64_to=lpo:sil=8000:random_seed=1858668754:i=126:bd=preordered_2997 on theBenchmark for (2997ds/126Mi)
% 9.69/2.28  % (720942)Instruction limit reached! 
% 9.69/2.28  % (720942)------------------------------
% 9.69/2.28  % (720942)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.69/2.28  % (720942)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.69/2.28  % (720942)CaDiCaL version: 2.1.3
% 9.69/2.28  % (720942)Termination reason: Instruction limit
% 9.69/2.28  % (720942)Termination phase: Saturation
% 9.69/2.28  % (720942)Time elapsed: 0.074 s
% 9.69/2.28  % (720942)Peak memory usage: 89 MB
% 9.69/2.28  % (720942)Instructions burned: 128 (million)
% 9.69/2.28  % (720946)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=11573428:avsq=on:i=194:fgj=on:bd=preordered_2995 on theBenchmark for (2995ds/194Mi)
% 9.69/2.28  % (720941)------------------------------
% 9.69/2.28  % (720941)------------------------------
% 9.69/2.28  % (720940)------------------------------
% 9.69/2.28  % (720940)------------------------------
% 9.69/2.28  % (720946)Instruction limit reached! 
% 9.69/2.28  % (720946)------------------------------
% 9.69/2.28  % (720946)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.69/2.28  % (720946)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.69/2.28  % (720946)CaDiCaL version: 2.1.3
% 9.69/2.28  % (720946)Termination reason: Instruction limit
% 9.69/2.28  % (720946)Termination phase: Saturation
% 9.69/2.28  % (720946)Time elapsed: 0.066 s
% 9.69/2.28  % (720946)Peak memory usage: 90 MB
% 9.69/2.28  % (720946)Instructions burned: 197 (million)
% 9.69/2.28  % (720948)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=332451438:i=157:gtg=all_2994 on theBenchmark for (2994ds/157Mi)
% 9.69/2.28  % (720950)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=3664711011:i=3394:sd=4:ss=included:sgt=64_2993 on theBenchmark for (2993ds/3394Mi)
% 9.69/2.28  % (720952)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=3833693215:i=107_2993 on theBenchmark for (2993ds/107Mi)
% 9.69/2.28  % (720951)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=3845490047:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2993 on theBenchmark for (2993ds/106Mi)
% 9.69/2.28  % (720952)Refutation not found, incomplete strategy
% 9.69/2.28  % (720952)------------------------------
% 9.69/2.28  % (720952)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.69/2.28  % (720952)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.69/2.28  % (720952)CaDiCaL version: 2.1.3
% 9.69/2.28  % (720952)Termination reason: Refutation not found, incomplete strategy
% 9.69/2.28  % (720952)Time elapsed: 0.001 s
% 9.69/2.28  % (720952)Peak memory usage: 87 MB
% 9.69/2.28  % (720948)Instruction limit reached! 
% 9.69/2.28  % (720948)------------------------------
% 9.69/2.28  % (720948)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.69/2.28  % (720948)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.69/2.28  % (720948)CaDiCaL version: 2.1.3
% 9.69/2.28  % (720948)Termination reason: Instruction limit
% 9.69/2.28  % (720948)Termination phase: Saturation
% 9.69/2.28  % (720948)Time elapsed: 0.102 s
% 9.69/2.28  % (720948)Peak memory usage: 91 MB
% 9.69/2.28  % (720948)Instructions burned: 157 (million)
% 9.69/2.28  % (720951)Instruction limit reached! 
% 9.69/2.28  % (720951)------------------------------
% 9.69/2.28  % (720951)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.69/2.28  % (720951)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.69/2.28  % (720951)CaDiCaL version: 2.1.3
% 9.69/2.28  % (720951)Termination reason: Instruction limit
% 9.69/2.28  % (720951)Termination phase: Saturation
% 9.69/2.28  % (720951)Time elapsed: 0.056 s
% 9.69/2.28  % (720951)Peak memory usage: 88 MB
% 9.69/2.28  % (720951)Instructions burned: 106 (million)
% 9.69/2.28  % (720957)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=1368792200:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2992 on theBenchmark for (2992ds/242Mi)
% 9.69/2.28  % (720958)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=2298563445:cond=fast:i=5208:av=off_2991 on theBenchmark for (2991ds/5208Mi)
% 9.69/2.28  % (720952)------------------------------
% 9.69/2.28  % (720952)------------------------------
% 9.69/2.28  % (720957)Instruction limit reached! 
% 9.69/2.28  % (720957)------------------------------
% 9.69/2.28  % (720957)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.69/2.28  % (720957)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.69/2.28  % (720957)CaDiCaL version: 2.1.3
% 9.69/2.28  % (720957)Termination reason: Instruction limit
% 9.69/2.28  % (720957)Termination phase: Saturation
% 9.69/2.28  % (720957)Time elapsed: 0.148 s
% 9.69/2.28  % (720957)Peak memory usage: 91 MB
% 9.69/2.28  % (720957)Instructions burned: 243 (million)
% 9.69/2.28  % (720961)lrs+1011_16_sil=32000:erd=off:bce=on:random_seed=2723011914:i=134:sd=2:doe=on:ss=axioms:sgt=14_2989 on theBenchmark for (2989ds/134Mi)
% 9.69/2.28  % (720950)First to succeed.
% 9.69/2.28  % (720950)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-720920"
% 9.69/2.28  % (720962)ott+10_5:4_to=lpo:sil=8000:prc=on:fde=unused:sp=unary_frequency:spb=goal:urr=on:random_seed=2739783219:i=499:bd=all_2989 on theBenchmark for (2989ds/499Mi)
% 9.69/2.28  % (720961)Instruction limit reached! 
% 9.69/2.28  % (720961)------------------------------
% 9.69/2.28  % (720961)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.69/2.28  % (720961)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.69/2.28  % (720961)CaDiCaL version: 2.1.3
% 9.69/2.28  % (720961)Termination reason: Instruction limit
% 9.69/2.28  % (720961)Termination phase: Saturation
% 9.69/2.28  % (720961)Time elapsed: 0.085 s
% 9.69/2.28  % (720961)Peak memory usage: 89 MB
% 9.69/2.28  % (720961)Instructions burned: 136 (million)
% 9.69/2.28  % (720950)Refutation found. Thanks to Tanya!
% 9.69/2.28  % SZS status Unsatisfiable for theBenchmark
% 9.69/2.28  % SZS output start Proof for theBenchmark
% See solution above
% 10.48/2.47  % (720950)------------------------------
% 10.48/2.47  % (720950)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.48/2.47  % (720950)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.48/2.47  % (720950)CaDiCaL version: 2.1.3
% 10.48/2.47  % (720950)Termination reason: Refutation
% 10.48/2.47  % (720950)Time elapsed: 0.480 s
% 10.48/2.47  % (720950)Peak memory usage: 131 MB
% 10.48/2.47  % (720950)Instructions burned: 1209 (million)
% 10.48/2.47  % (720950)------------------------------
% 10.48/2.47  % (720950)------------------------------
% 10.48/2.47  % (720920)Success in time 1.403 s
% 10.48/2.47  % Vampire exiting
%------------------------------------------------------------------------------