↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n002.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:59 AM UTC 2026

% Result   : Unsatisfiable 14.86s 3.27s
% Output   : Refutation 15.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   24
%            Number of leaves      :   25
% Syntax   : Number of formulae    :  113 (  77 unt;  14 def)
%            Number of atoms       :  160 (  32 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   97 (  50   ~;  47   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   21 (  21 usr;  16 con; 0-2 aty)
%            Number of variables   :  127 ( 127   !;   0   ?)

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

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

fof(f3,axiom,
    ! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
    file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).

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

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

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

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

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

fof(f11,negated_conjecture,
    ~ theorem(implies(and(not(p),not(q)),equivalent(p,q))),
    file('/export/starexec/sandbox2/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,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    inference(definition_unfolding,[],[f1,f6]) ).

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

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

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

fof(f17,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(f18,plain,
    ! [X0,X1] :
      ( ~ theorem(or(not(X1),X0))
      | theorem(X0)
      | ~ theorem(X1) ),
    inference(definition_unfolding,[],[f8,f6]) ).

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

fof(f20,definition,
    sF0 = not(p),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f21,plain,
    not(p) = sF0,
    inference(reorient_equations,[],[f20]) ).

fof(f22,definition,
    sF1 = not(sF0),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f23,plain,
    not(sF0) = sF1,
    inference(reorient_equations,[],[f22]) ).

fof(f24,definition,
    sF2 = not(q),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f25,plain,
    not(q) = sF2,
    inference(reorient_equations,[],[f24]) ).

fof(f26,definition,
    sF3 = not(sF2),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f27,plain,
    not(sF2) = sF3,
    inference(reorient_equations,[],[f26]) ).

fof(f28,definition,
    sF4 = or(sF1,sF3),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f29,plain,
    or(sF1,sF3) = sF4,
    inference(reorient_equations,[],[f28]) ).

fof(f30,definition,
    sF5 = not(sF4),
    introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).

fof(f31,plain,
    not(sF4) = sF5,
    inference(reorient_equations,[],[f30]) ).

fof(f32,definition,
    sF6 = not(sF5),
    introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).

fof(f33,plain,
    not(sF5) = sF6,
    inference(reorient_equations,[],[f32]) ).

fof(f34,definition,
    sF7 = or(sF0,q),
    introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).

fof(f35,plain,
    or(sF0,q) = sF7,
    inference(reorient_equations,[],[f34]) ).

fof(f36,definition,
    sF8 = not(sF7),
    introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).

fof(f37,plain,
    not(sF7) = sF8,
    inference(reorient_equations,[],[f36]) ).

fof(f38,definition,
    sF9 = or(sF2,p),
    introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).

fof(f39,plain,
    or(sF2,p) = sF9,
    inference(reorient_equations,[],[f38]) ).

fof(f40,definition,
    sF10 = not(sF9),
    introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).

fof(f41,plain,
    not(sF9) = sF10,
    inference(reorient_equations,[],[f40]) ).

fof(f42,definition,
    sF11 = or(sF8,sF10),
    introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).

fof(f43,plain,
    or(sF8,sF10) = sF11,
    inference(reorient_equations,[],[f42]) ).

fof(f44,definition,
    sF12 = not(sF11),
    introduced(definition,[new_symbols(definition,[sF12])],[function_definition]) ).

fof(f45,plain,
    not(sF11) = sF12,
    inference(reorient_equations,[],[f44]) ).

fof(f46,definition,
    sF13 = or(sF6,sF12),
    introduced(definition,[new_symbols(definition,[sF13])],[function_definition]) ).

fof(f47,plain,
    or(sF6,sF12) = sF13,
    inference(reorient_equations,[],[f46]) ).

fof(f48,plain,
    ~ theorem(sF13),
    inference(definition_folding,[],[f19,f47,f45,f43,f41,f39,f25,f37,f35,f21,f33,f31,f29,f27,f25,f23,f21]) ).

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

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

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

fof(f81,plain,
    theorem(or(not(or(sF12,sF6)),sF13)),
    inference(superposition,[],[f77,f47]) ).

fof(f82,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X1,or(X0,X2)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f18,f54]) ).

fof(f83,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X1)),or(X0,X2)))
      | ~ theorem(or(not(X1),X2)) ),
    inference(resolution,[],[f18,f53]) ).

fof(f84,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,X0))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f18,f77]) ).

fof(f236,plain,
    theorem(or(not(sF11),or(sF10,sF8))),
    inference(superposition,[],[f77,f43]) ).

fof(f238,plain,
    theorem(or(sF12,or(sF10,sF8))),
    inference(forward_demodulation,[],[f236,f45]) ).

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

fof(f271,plain,
    theorem(or(not(sF3),sF4)),
    inference(superposition,[],[f242,f29]) ).

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

fof(f287,plain,
    ! [X0] :
      ( ~ theorem(or(X0,X0))
      | theorem(X0) ),
    inference(resolution,[],[f277,f18]) ).

fof(f290,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(not(X0),X1))
      | theorem(or(X2,X1))
      | ~ theorem(or(X2,X0)) ),
    inference(resolution,[],[f83,f18]) ).

fof(f309,plain,
    ! [X2,X3,X0,X1] :
      ( ~ theorem(or(X0,or(X2,or(X1,X3))))
      | theorem(or(X0,or(X1,or(X2,X3)))) ),
    inference(resolution,[],[f290,f54]) ).

fof(f311,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X0,or(X2,X1)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f290,f77]) ).

fof(f312,plain,
    ! [X2,X3,X0,X1] :
      ( ~ theorem(or(X0,or(X1,X3)))
      | theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(not(X3),X2)) ),
    inference(resolution,[],[f290,f83]) ).

fof(f313,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(X0,X2)) ),
    inference(resolution,[],[f290,f242]) ).

fof(f314,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X0,or(X1,X1)))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f290,f277]) ).

fof(f319,plain,
    ! [X0,X1] :
      ( ~ theorem(or(sF5,X0))
      | theorem(or(X1,X0))
      | ~ theorem(or(X1,sF4)) ),
    inference(superposition,[],[f290,f31]) ).

fof(f327,plain,
    ! [X0] : theorem(or(not(X0),X0)),
    inference(resolution,[],[f314,f242]) ).

fof(f333,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
    inference(resolution,[],[f311,f242]) ).

fof(f352,plain,
    ! [X0] : theorem(or(X0,not(X0))),
    inference(resolution,[],[f327,f84]) ).

fof(f374,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X1)),or(X1,X2)))
      | ~ theorem(or(not(X0),X2)) ),
    inference(resolution,[],[f312,f77]) ).

fof(f376,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,[],[f312,f54]) ).

fof(f444,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f313,f311]) ).

fof(f459,plain,
    ! [X2,X0,X1] : theorem(or(not(or(or(X0,X1),X2)),or(X0,or(X2,X1)))),
    inference(resolution,[],[f309,f77]) ).

fof(f472,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(not(X0),X1))
      | theorem(or(X2,X1))
      | ~ theorem(or(X0,X2)) ),
    inference(resolution,[],[f374,f18]) ).

fof(f528,plain,
    ! [X2,X3,X0,X1] :
      ( ~ theorem(or(not(or(X0,X1)),X2))
      | theorem(or(X3,X2))
      | ~ theorem(or(X0,or(X3,X1))) ),
    inference(resolution,[],[f376,f18]) ).

fof(f549,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X1,or(X0,X2)))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f444,f82]) ).

fof(f555,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF1))
      | theorem(or(X0,sF4)) ),
    inference(superposition,[],[f444,f29]) ).

fof(f557,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF6))
      | theorem(or(X0,sF13)) ),
    inference(superposition,[],[f444,f47]) ).

fof(f584,plain,
    ! [X0,X1] : theorem(or(X0,or(not(X0),X1))),
    inference(resolution,[],[f333,f82]) ).

fof(f609,plain,
    ! [X0] :
      ( theorem(or(X0,not(sF5)))
      | ~ theorem(or(X0,sF4)) ),
    inference(resolution,[],[f319,f352]) ).

fof(f612,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF4))
      | theorem(or(X0,sF6)) ),
    inference(forward_demodulation,[],[f609,f33]) ).

fof(f733,plain,
    ! [X0,X1] :
      ( ~ theorem(or(not(sF7),X0))
      | theorem(or(X1,X0))
      | ~ theorem(or(sF0,or(X1,q))) ),
    inference(superposition,[],[f528,f35]) ).

fof(f735,plain,
    ! [X0,X1] :
      ( ~ theorem(or(not(sF9),X0))
      | theorem(or(X1,X0))
      | ~ theorem(or(sF2,or(X1,p))) ),
    inference(superposition,[],[f528,f39]) ).

fof(f739,plain,
    ! [X0,X1] :
      ( ~ theorem(or(sF2,or(X1,p)))
      | theorem(or(X1,X0))
      | ~ theorem(or(sF10,X0)) ),
    inference(forward_demodulation,[],[f735,f41]) ).

fof(f741,plain,
    ! [X0,X1] :
      ( ~ theorem(or(sF0,or(X1,q)))
      | theorem(or(X1,X0))
      | ~ theorem(or(sF8,X0)) ),
    inference(forward_demodulation,[],[f733,f37]) ).

fof(f929,plain,
    ! [X0] :
      ( theorem(or(not(sF2),X0))
      | ~ theorem(or(sF10,X0)) ),
    inference(resolution,[],[f739,f584]) ).

fof(f931,plain,
    ! [X0] :
      ( ~ theorem(or(sF10,X0))
      | theorem(or(sF3,X0)) ),
    inference(forward_demodulation,[],[f929,f27]) ).

fof(f997,plain,
    ! [X0] :
      ( theorem(or(not(sF0),X0))
      | ~ theorem(or(sF8,X0)) ),
    inference(resolution,[],[f741,f584]) ).

fof(f1001,plain,
    ! [X0] :
      ( ~ theorem(or(sF8,X0))
      | theorem(or(sF1,X0)) ),
    inference(forward_demodulation,[],[f997,f23]) ).

fof(f1039,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(or(X0,X2),X1))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f459,f18]) ).

fof(f1060,plain,
    theorem(or(not(sF3),sF6)),
    inference(resolution,[],[f271,f612]) ).

fof(f1066,plain,
    theorem(or(not(sF3),sF13)),
    inference(resolution,[],[f1060,f557]) ).

fof(f1068,plain,
    ! [X0] :
      ( ~ theorem(or(sF3,X0))
      | theorem(or(X0,sF13)) ),
    inference(resolution,[],[f1066,f472]) ).

fof(f1092,plain,
    ! [X0] :
      ( ~ theorem(or(X0,or(sF12,sF6)))
      | theorem(or(X0,sF13)) ),
    inference(resolution,[],[f81,f290]) ).

fof(f1097,plain,
    ! [X0] :
      ( ~ theorem(or(sF12,X0))
      | theorem(or(X0,sF13)) ),
    inference(resolution,[],[f1092,f549]) ).

fof(f1111,plain,
    theorem(or(or(sF10,sF8),sF13)),
    inference(resolution,[],[f1097,f238]) ).

fof(f1498,plain,
    theorem(or(sF10,or(sF13,sF8))),
    inference(resolution,[],[f1039,f1111]) ).

fof(f1517,plain,
    theorem(or(sF10,or(sF8,sF13))),
    inference(resolution,[],[f1498,f311]) ).

fof(f1524,plain,
    theorem(or(sF8,or(sF10,sF13))),
    inference(resolution,[],[f1517,f82]) ).

fof(f1526,plain,
    theorem(or(sF1,or(sF10,sF13))),
    inference(resolution,[],[f1524,f1001]) ).

fof(f1535,plain,
    theorem(or(sF10,or(sF1,sF13))),
    inference(resolution,[],[f1526,f82]) ).

fof(f1537,plain,
    theorem(or(sF3,or(sF1,sF13))),
    inference(resolution,[],[f1535,f931]) ).

fof(f1543,plain,
    theorem(or(or(sF1,sF13),sF13)),
    inference(resolution,[],[f1537,f1068]) ).

fof(f1554,plain,
    theorem(or(sF1,or(sF13,sF13))),
    inference(resolution,[],[f1543,f1039]) ).

fof(f1560,plain,
    theorem(or(sF1,sF13)),
    inference(resolution,[],[f1554,f314]) ).

fof(f1563,plain,
    theorem(or(sF13,sF1)),
    inference(resolution,[],[f1560,f84]) ).

fof(f1571,plain,
    theorem(or(sF13,sF4)),
    inference(resolution,[],[f1563,f555]) ).

fof(f1619,plain,
    theorem(or(sF13,sF6)),
    inference(resolution,[],[f1571,f612]) ).

fof(f1623,plain,
    theorem(or(sF13,sF13)),
    inference(resolution,[],[f1619,f557]) ).

fof(f1625,plain,
    theorem(sF13),
    inference(resolution,[],[f1623,f287]) ).

fof(f1627,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f1625,f48]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL327-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.61  % Computer : n002.cluster.edu
% 0.14/0.61  % Model    : x86_64 x86_64
% 0.14/0.61  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.61  % Memory   : 8046.5625MB
% 0.14/0.61  % OS       : Linux 6.8.0-71-generic
% 0.14/0.61  % CPULimit : 300
% 0.14/0.61  % WCLimit  : 300
% 0.14/0.61  % DateTime : Sun Sep 27 15:37:23 UTC 2026
% 0.14/0.61  % CPUTime  : 
% 0.14/0.61  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.65  Running first-order theorem proving
% 0.18/0.65  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.86/3.27  % (3688029)Input is clausal, will run a generic CNF schedule.
% 14.86/3.27  % (3688052)dis-21_1_sil=8000:lcm=predicate:random_seed=2107059047: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)
% 14.86/3.27  % (3688051)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2975755594:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 14.86/3.27  % (3688048)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=277761678:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 14.86/3.27  % (3688046)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=4034117295:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 14.86/3.27  % (3688052)Instruction limit reached! 
% 14.86/3.27  % (3688052)------------------------------
% 14.86/3.27  % (3688052)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.86/3.27  % (3688052)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.86/3.27  % (3688052)CaDiCaL version: 2.1.3
% 14.86/3.27  % (3688052)Termination reason: Instruction limit
% 14.86/3.27  % (3688052)Termination phase: Saturation
% 14.86/3.27  % (3688052)Time elapsed: 0.053 s
% 14.86/3.27  % (3688052)Peak memory usage: 87 MB
% 14.86/3.27  % (3688052)Instructions burned: 118 (million)
% 14.86/3.27  % (3688049)lrs+10_1_sil=8000:sp=occurrence:random_seed=271003633:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 14.86/3.27  % (3688047)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1205552979:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 14.86/3.27  % (3688050)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3884096946:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 14.86/3.27  % (3688049)Instruction limit reached! 
% 14.86/3.27  % (3688049)------------------------------
% 14.86/3.27  % (3688049)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.86/3.27  % (3688049)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.86/3.27  % (3688049)CaDiCaL version: 2.1.3
% 14.86/3.27  % (3688049)Termination reason: Instruction limit
% 14.86/3.27  % (3688049)Termination phase: Saturation
% 14.86/3.27  % (3688049)Time elapsed: 0.079 s
% 14.86/3.27  % (3688049)Peak memory usage: 89 MB
% 14.86/3.27  % (3688049)Instructions burned: 107 (million)
% 14.86/3.27  % (3688051)Instruction limit reached! 
% 14.86/3.27  % (3688051)------------------------------
% 14.86/3.27  % (3688051)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.86/3.27  % (3688051)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.86/3.27  % (3688051)CaDiCaL version: 2.1.3
% 14.86/3.27  % (3688051)Termination reason: Instruction limit
% 14.86/3.27  % (3688051)Termination phase: Saturation
% 14.86/3.27  % (3688051)Time elapsed: 0.126 s
% 14.86/3.27  % (3688051)Peak memory usage: 89 MB
% 14.86/3.27  % (3688051)Instructions burned: 182 (million)
% 14.86/3.27  % (3688050)Instruction limit reached! 
% 14.86/3.27  % (3688050)------------------------------
% 14.86/3.27  % (3688050)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.86/3.27  % (3688050)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.86/3.27  % (3688050)CaDiCaL version: 2.1.3
% 14.86/3.27  % (3688050)Termination reason: Instruction limit
% 14.86/3.27  % (3688050)Termination phase: Saturation
% 14.86/3.27  % (3688050)Time elapsed: 0.117 s
% 14.86/3.27  % (3688050)Peak memory usage: 89 MB
% 14.86/3.27  % (3688050)Instructions burned: 114 (million)
% 14.86/3.27  % (3688058)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=1233252790:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 14.86/3.27  % (3688058)Refutation not found, incomplete strategy
% 14.86/3.27  % (3688058)------------------------------
% 14.86/3.27  % (3688058)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.86/3.27  % (3688058)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.86/3.27  % (3688058)CaDiCaL version: 2.1.3
% 14.86/3.27  % (3688058)Termination reason: Refutation not found, incomplete strategy
% 14.86/3.27  % (3688058)Time elapsed: 0.002 s
% 14.86/3.27  % (3688058)Peak memory usage: 88 MB
% 14.86/3.27  % (3688063)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=1310159521: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)
% 14.86/3.27  % (3688063)Refutation not found, incomplete strategy
% 14.86/3.27  % (3688063)------------------------------
% 14.86/3.27  % (3688063)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.86/3.27  % (3688063)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.86/3.27  % (3688063)CaDiCaL version: 2.1.3
% 14.86/3.27  % (3688063)Termination reason: Refutation not found, incomplete strategy
% 14.86/3.27  % (3688063)Time elapsed: 0.001 s
% 14.86/3.27  % (3688063)Peak memory usage: 87 MB
% 14.86/3.27  % (3688064)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=3816707198:st=4:i=219:sd=3:ss=axioms_2996 on theBenchmark for (2996ds/219Mi)
% 14.86/3.27  % (3688064)Refutation not found, incomplete strategy
% 14.86/3.27  % (3688064)------------------------------
% 14.86/3.27  % (3688064)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.86/3.27  % (3688064)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.86/3.27  % (3688064)CaDiCaL version: 2.1.3
% 14.86/3.27  % (3688064)Termination reason: Refutation not found, incomplete strategy
% 14.86/3.27  % (3688064)Time elapsed: 0.002 s
% 14.86/3.27  % (3688064)Peak memory usage: 88 MB
% 14.86/3.27  % (3688064)Instructions burned: 1 (million)
% 14.86/3.27  % (3688065)lrs+10_64_to=lpo:sil=8000:random_seed=3995819765:i=126:bd=preordered_2996 on theBenchmark for (2996ds/126Mi)
% 14.86/3.27  % (3688065)Instruction limit reached! 
% 14.86/3.27  % (3688065)------------------------------
% 14.86/3.27  % (3688065)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.86/3.27  % (3688065)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.86/3.27  % (3688065)CaDiCaL version: 2.1.3
% 14.86/3.27  % (3688065)Termination reason: Instruction limit
% 14.86/3.27  % (3688065)Termination phase: Saturation
% 14.86/3.27  % (3688065)Time elapsed: 0.098 s
% 14.86/3.27  % (3688065)Peak memory usage: 89 MB
% 14.86/3.27  % (3688065)Instructions burned: 126 (million)
% 14.86/3.27  % (3688063)------------------------------
% 14.86/3.27  % (3688063)------------------------------
% 14.86/3.27  % (3688058)------------------------------
% 14.86/3.27  % (3688058)------------------------------
% 14.86/3.27  % (3688072)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=2166885531:avsq=on:i=194:fgj=on:bd=preordered_2993 on theBenchmark for (2993ds/194Mi)
% 14.86/3.27  % (3688064)------------------------------
% 14.86/3.27  % (3688064)------------------------------
% 14.86/3.27  % (3688073)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=2578988184:i=157:gtg=all_2992 on theBenchmark for (2992ds/157Mi)
% 14.86/3.27  % (3688072)Instruction limit reached! 
% 14.86/3.27  % (3688072)------------------------------
% 14.86/3.27  % (3688072)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.86/3.27  % (3688072)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.86/3.27  % (3688072)CaDiCaL version: 2.1.3
% 14.86/3.27  % (3688072)Termination reason: Instruction limit
% 14.86/3.27  % (3688072)Termination phase: Saturation
% 14.86/3.27  % (3688072)Time elapsed: 0.112 s
% 14.86/3.27  % (3688072)Peak memory usage: 90 MB
% 14.86/3.27  % (3688072)Instructions burned: 194 (million)
% 14.86/3.27  % (3688075)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=3467307164:i=3394:sd=4:ss=included:sgt=64_2992 on theBenchmark for (2992ds/3394Mi)
% 14.86/3.27  % (3688080)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=3942783272:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2990 on theBenchmark for (2990ds/106Mi)
% 14.86/3.27  % (3688073)Instruction limit reached! 
% 14.86/3.27  % (3688073)------------------------------
% 14.86/3.27  % (3688073)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.86/3.27  % (3688073)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.86/3.27  % (3688073)CaDiCaL version: 2.1.3
% 14.86/3.27  % (3688073)Termination reason: Instruction limit
% 14.86/3.27  % (3688073)Termination phase: Saturation
% 14.86/3.27  % (3688073)Time elapsed: 0.172 s
% 14.86/3.27  % (3688073)Peak memory usage: 91 MB
% 14.86/3.27  % (3688073)Instructions burned: 157 (million)
% 14.86/3.27  % (3688081)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=4120796043:i=107_2990 on theBenchmark for (2990ds/107Mi)
% 14.86/3.27  % (3688081)Refutation not found, incomplete strategy
% 14.86/3.27  % (3688081)------------------------------
% 14.86/3.27  % (3688081)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.86/3.27  % (3688081)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.86/3.27  % (3688081)CaDiCaL version: 2.1.3
% 14.86/3.27  % (3688081)Termination reason: Refutation not found, incomplete strategy
% 14.86/3.27  % (3688081)Time elapsed: 0.001 s
% 14.86/3.27  % (3688081)Peak memory usage: 87 MB
% 14.86/3.27  % (3688080)Instruction limit reached! 
% 14.86/3.27  % (3688080)------------------------------
% 14.86/3.27  % (3688080)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.86/3.27  % (3688080)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.86/3.27  % (3688080)CaDiCaL version: 2.1.3
% 14.86/3.27  % (3688080)Termination reason: Instruction limit
% 14.86/3.27  % (3688080)Termination phase: Saturation
% 14.86/3.27  % (3688080)Time elapsed: 0.051 s
% 14.86/3.27  % (3688080)Peak memory usage: 89 MB
% 14.86/3.27  % (3688080)Instructions burned: 108 (million)
% 14.86/3.27  % (3688087)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=2471856157:cond=fast:i=5208:av=off_2988 on theBenchmark for (2988ds/5208Mi)
% 14.86/3.27  % (3688085)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=2633003649:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2989 on theBenchmark for (2989ds/242Mi)
% 14.86/3.27  % (3688081)------------------------------
% 14.86/3.27  % (3688081)------------------------------
% 14.86/3.27  % (3688085)Instruction limit reached! 
% 14.86/3.27  % (3688085)------------------------------
% 14.86/3.27  % (3688085)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.86/3.27  % (3688085)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.86/3.27  % (3688085)CaDiCaL version: 2.1.3
% 14.86/3.27  % (3688085)Termination reason: Instruction limit
% 14.86/3.27  % (3688085)Termination phase: Saturation
% 14.86/3.27  % (3688085)Time elapsed: 0.247 s
% 14.86/3.27  % (3688085)Peak memory usage: 91 MB
% 14.86/3.27  % (3688085)Instructions burned: 242 (million)
% 14.86/3.27  % (3688046)First to succeed.
% 14.86/3.27  % (3688093)lrs+1011_16_sil=32000:erd=off:bce=on:random_seed=3027569159:i=134:sd=2:doe=on:ss=axioms:sgt=14_2985 on theBenchmark for (2985ds/134Mi)
% 14.86/3.27  % (3688046)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3688029"
% 14.86/3.27  % (3688096)ott+10_5:4_to=lpo:sil=8000:prc=on:fde=unused:sp=unary_frequency:spb=goal:urr=on:random_seed=3991574971:i=499:bd=all_2984 on theBenchmark for (2984ds/499Mi)
% 14.86/3.27  % (3688093)Instruction limit reached! 
% 14.86/3.27  % (3688093)------------------------------
% 14.86/3.27  % (3688093)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.86/3.27  % (3688093)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.86/3.27  % (3688093)CaDiCaL version: 2.1.3
% 14.86/3.27  % (3688093)Termination reason: Instruction limit
% 14.86/3.27  % (3688093)Termination phase: Saturation
% 14.86/3.27  % (3688093)Time elapsed: 0.128 s
% 14.86/3.27  % (3688093)Peak memory usage: 90 MB
% 14.86/3.27  % (3688093)Instructions burned: 134 (million)
% 14.86/3.27  % (3688100)lrs+10_64_to=lpo:sil=8000:prc=on:sp=reverse_frequency:nwc=5:alpa=false:flr=on:random_seed=3321034764:i=191:fgj=on:bd=all_2982 on theBenchmark for (2982ds/191Mi)
% 14.86/3.27  % (3688046)Refutation found. Thanks to Tanya!
% 14.86/3.27  % SZS status Unsatisfiable for theBenchmark
% 14.86/3.27  % SZS output start Proof for theBenchmark
% See solution above
% 15.66/3.57  % (3688046)------------------------------
% 15.66/3.57  % (3688046)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 15.66/3.57  % (3688046)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.66/3.57  % (3688046)CaDiCaL version: 2.1.3
% 15.66/3.57  % (3688046)Termination reason: Refutation
% 15.66/3.57  % (3688046)Time elapsed: 1.477 s
% 15.66/3.57  % (3688046)Peak memory usage: 132 MB
% 15.66/3.57  % (3688046)Instructions burned: 1387 (million)
% 15.66/3.57  % (3688046)------------------------------
% 15.66/3.57  % (3688046)------------------------------
% 15.66/3.57  % (3688029)Success in time 2.114 s
% 15.66/3.57  % Vampire exiting
%------------------------------------------------------------------------------