↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n001.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:35 AM UTC 2026

% Result   : Unsatisfiable 8.52s 2.26s
% Output   : Refutation 8.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   24
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   60 (  60 unt;   0 def)
%            Number of atoms       :   60 (  59 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   3 con; 0-4 aty)
%            Number of variables   :  121 ( 121   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X0,X1] : ifeq(X0,X0,X1,X2) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).

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

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

fof(f4,plain,
    ! [X0,X1] : true = axiom(implies(X0,or(X1,X0))),
    inference(reorient_equations,[],[f3]) ).

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

fof(f6,plain,
    ! [X0,X1] : true = axiom(implies(or(X0,X1),or(X1,X0))),
    inference(reorient_equations,[],[f5]) ).

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

fof(f8,plain,
    ! [X2,X0,X1] : true = axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    inference(reorient_equations,[],[f7]) ).

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

fof(f10,plain,
    ! [X2,X0,X1] : true = axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    inference(reorient_equations,[],[f9]) ).

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

fof(f12,axiom,
    ! [X0] : ifeq(axiom(X0),true,theorem(X0),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).

fof(f13,plain,
    ! [X0] : true = ifeq(axiom(X0),true,theorem(X0),true),
    inference(reorient_equations,[],[f12]) ).

fof(f14,axiom,
    ! [X0,X1] : ifeq(theorem(implies(X0,X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).

fof(f15,plain,
    ! [X0,X1] : true = ifeq(theorem(implies(X0,X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true),
    inference(reorient_equations,[],[f14]) ).

fof(f16,negated_conjecture,
    theorem(implies(not(q),implies(or(p,q),p))) != true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f17,plain,
    true != theorem(implies(not(q),implies(or(p,q),p))),
    inference(reorient_equations,[],[f16]) ).

fof(f18,plain,
    ! [X0] : true = axiom(or(not(or(X0,X0)),X0)),
    inference(definition_unfolding,[],[f2,f11]) ).

fof(f19,plain,
    ! [X0,X1] : true = axiom(or(not(X0),or(X1,X0))),
    inference(definition_unfolding,[],[f4,f11]) ).

fof(f20,plain,
    ! [X0,X1] : true = axiom(or(not(or(X0,X1)),or(X1,X0))),
    inference(definition_unfolding,[],[f6,f11]) ).

fof(f21,plain,
    ! [X2,X0,X1] : true = axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(definition_unfolding,[],[f8,f11]) ).

fof(f22,plain,
    ! [X2,X0,X1] : true = axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(definition_unfolding,[],[f10,f11,f11,f11]) ).

fof(f23,plain,
    ! [X0,X1] : true = ifeq(theorem(or(not(X0),X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true),
    inference(definition_unfolding,[],[f15,f11]) ).

fof(f24,plain,
    true != theorem(or(not(not(q)),or(not(or(p,q)),p))),
    inference(definition_unfolding,[],[f17,f11,f11]) ).

fof(f25,plain,
    ! [X0,X1] : true = ifeq(true,true,theorem(or(not(or(X0,X1)),or(X1,X0))),true),
    inference(superposition,[],[f13,f20]) ).

fof(f26,plain,
    ! [X0,X1] : true = ifeq(true,true,theorem(or(not(X0),or(X1,X0))),true),
    inference(superposition,[],[f13,f19]) ).

fof(f27,plain,
    ! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),true),
    inference(superposition,[],[f13,f21]) ).

fof(f28,plain,
    ! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),true),
    inference(superposition,[],[f13,f22]) ).

fof(f29,plain,
    ! [X0] : true = ifeq(true,true,theorem(or(not(or(X0,X0)),X0)),true),
    inference(superposition,[],[f13,f18]) ).

fof(f30,plain,
    ! [X0] : true = theorem(or(not(or(X0,X0)),X0)),
    inference(forward_demodulation,[],[f29,f1]) ).

fof(f31,plain,
    ! [X2,X0,X1] : true = theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(forward_demodulation,[],[f28,f1]) ).

fof(f32,plain,
    ! [X2,X0,X1] : true = theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(forward_demodulation,[],[f27,f1]) ).

fof(f33,plain,
    ! [X0,X1] : true = theorem(or(not(X0),or(X1,X0))),
    inference(forward_demodulation,[],[f26,f1]) ).

fof(f34,plain,
    ! [X0,X1] : true = theorem(or(not(or(X0,X1)),or(X1,X0))),
    inference(forward_demodulation,[],[f25,f1]) ).

fof(f43,plain,
    ! [X2,X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X1,or(X0,X2))),true),true),
    inference(superposition,[],[f23,f32]) ).

fof(f46,plain,
    ! [X2,X0,X1] : true = ifeq(true,true,ifeq(theorem(or(not(X0),X1)),true,theorem(or(not(or(X2,X0)),or(X2,X1))),true),true),
    inference(superposition,[],[f23,f31]) ).

fof(f59,plain,
    ! [X2,X0,X1] : true = ifeq(theorem(or(not(X0),X1)),true,theorem(or(not(or(X2,X0)),or(X2,X1))),true),
    inference(forward_demodulation,[],[f46,f1]) ).

fof(f62,plain,
    ! [X2,X0,X1] : true = ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X1,or(X0,X2))),true),
    inference(forward_demodulation,[],[f43,f1]) ).

fof(f98,plain,
    ! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(X2,or(X0,X1))),or(X2,or(X1,X0)))),true),
    inference(superposition,[],[f59,f34]) ).

fof(f102,plain,
    ! [X0,X1] : true = ifeq(true,true,theorem(or(not(or(X1,or(X0,X0))),or(X1,X0))),true),
    inference(superposition,[],[f59,f30]) ).

fof(f110,plain,
    ! [X0,X1] : true = theorem(or(not(or(X1,or(X0,X0))),or(X1,X0))),
    inference(forward_demodulation,[],[f102,f1]) ).

fof(f114,plain,
    ! [X2,X0,X1] : true = theorem(or(not(or(X2,or(X0,X1))),or(X2,or(X1,X0)))),
    inference(forward_demodulation,[],[f98,f1]) ).

fof(f131,plain,
    ! [X2,X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X0,or(X2,X1))),true),true),
    inference(superposition,[],[f23,f114]) ).

fof(f139,plain,
    ! [X2,X0,X1] : true = ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X0,or(X2,X1))),true),
    inference(forward_demodulation,[],[f131,f1]) ).

fof(f143,plain,
    ! [X0,X1] : true = ifeq(true,true,theorem(or(not(X0),or(X0,X1))),true),
    inference(superposition,[],[f139,f33]) ).

fof(f163,plain,
    ! [X0,X1] : true = theorem(or(not(X0),or(X0,X1))),
    inference(forward_demodulation,[],[f143,f1]) ).

fof(f171,plain,
    ! [X0,X1] : true = ifeq(true,true,theorem(or(X0,or(not(X0),X1))),true),
    inference(superposition,[],[f62,f163]) ).

fof(f176,plain,
    ! [X0,X1] : true = theorem(or(X0,or(not(X0),X1))),
    inference(forward_demodulation,[],[f171,f1]) ).

fof(f405,plain,
    ! [X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,or(X1,X1))),true,theorem(or(X0,X1)),true),true),
    inference(superposition,[],[f23,f110]) ).

fof(f424,plain,
    ! [X0,X1] : true = ifeq(theorem(or(X0,or(X1,X1))),true,theorem(or(X0,X1)),true),
    inference(forward_demodulation,[],[f405,f1]) ).

fof(f438,plain,
    ! [X0] : true = ifeq(true,true,theorem(or(X0,not(X0))),true),
    inference(superposition,[],[f424,f176]) ).

fof(f456,plain,
    ! [X0] : true = theorem(or(X0,not(X0))),
    inference(forward_demodulation,[],[f438,f1]) ).

fof(f470,plain,
    ! [X0,X1] : true = ifeq(true,true,theorem(or(not(or(X1,X0)),or(X1,not(not(X0))))),true),
    inference(superposition,[],[f59,f456]) ).

fof(f486,plain,
    ! [X0,X1] : true = theorem(or(not(or(X1,X0)),or(X1,not(not(X0))))),
    inference(forward_demodulation,[],[f470,f1]) ).

fof(f495,plain,
    ! [X0,X1] : true = ifeq(true,true,theorem(or(not(or(X0,X1)),or(not(not(X1)),X0))),true),
    inference(superposition,[],[f139,f486]) ).

fof(f509,plain,
    ! [X0,X1] : true = theorem(or(not(or(X0,X1)),or(not(not(X1)),X0))),
    inference(forward_demodulation,[],[f495,f1]) ).

fof(f525,plain,
    ! [X0,X1] : true = ifeq(true,true,theorem(or(not(not(X1)),or(not(or(X0,X1)),X0))),true),
    inference(superposition,[],[f62,f509]) ).

fof(f536,plain,
    ! [X0,X1] : true = theorem(or(not(not(X1)),or(not(or(X0,X1)),X0))),
    inference(forward_demodulation,[],[f525,f1]) ).

fof(f570,plain,
    true != true,
    inference(superposition,[],[f24,f536]) ).

fof(f583,plain,
    $false,
    inference(trivial_inequality_removal,[],[f570]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL211-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38  % Computer : n001.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 27 15:32:46 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43  Running first-order theorem proving
% 0.11/0.43  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
% 8.15/2.06  % (3719436)Detected a unit-equality problem, will run specialized UEQ schedule.
% 8.15/2.06  % (3719450)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=1524790400:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 8.15/2.06  % (3719452)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=3241680597:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 8.15/2.06  % (3719451)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=3687957831:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 8.15/2.06  % (3719447)lrs+11_1_ncem=casc2026/models/loop6.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3527175849:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 8.15/2.06  % (3719446)lrs+1002_1_ncem=casc2026/models/loop7.pt:sil=128000:tgt=ground:npcc=on:drc=off:sp=reverse_frequency:spb=goal:acc=on:s2agt=16:kmz=on:sac=on:random_seed=1798152198:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 8.15/2.06  % (3719448)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=2765044672:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 8.15/2.06  % (3719449)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=4159958833:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 8.15/2.06  % (3719450)Instruction limit reached! 
% 8.15/2.06  % (3719450)------------------------------
% 8.15/2.06  % (3719450)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.15/2.06  % (3719450)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.15/2.06  % (3719450)CaDiCaL version: 2.1.3
% 8.15/2.06  % (3719450)Termination reason: Instruction limit
% 8.15/2.06  % (3719450)Termination phase: Saturation
% 8.15/2.06  % (3719450)Time elapsed: 0.060 s
% 8.15/2.06  % (3719450)Peak memory usage: 89 MB
% 8.15/2.06  % (3719450)Instructions burned: 184 (million)
% 8.15/2.06  % (3719449)Instruction limit reached! 
% 8.15/2.06  % (3719449)------------------------------
% 8.15/2.06  % (3719449)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.15/2.06  % (3719449)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.15/2.06  % (3719449)CaDiCaL version: 2.1.3
% 8.15/2.06  % (3719449)Termination reason: Instruction limit
% 8.15/2.06  % (3719449)Termination phase: Saturation
% 8.15/2.06  % (3719449)Time elapsed: 0.086 s
% 8.15/2.06  % (3719449)Peak memory usage: 89 MB
% 8.15/2.06  % (3719449)Instructions burned: 136 (million)
% 8.15/2.06  % (3719484)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=2156260081:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2998 on theBenchmark for (2998ds/2051Mi)
% 8.15/2.06  % (3719451)Instruction limit reached! 
% 8.15/2.06  % (3719451)------------------------------
% 8.15/2.06  % (3719451)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.15/2.06  % (3719451)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.15/2.06  % (3719451)CaDiCaL version: 2.1.3
% 8.15/2.06  % (3719451)Termination reason: Instruction limit
% 8.15/2.06  % (3719451)Termination phase: Saturation
% 8.15/2.06  % (3719451)Time elapsed: 0.150 s
% 8.15/2.06  % (3719451)Peak memory usage: 90 MB
% 8.15/2.06  % (3719451)Instructions burned: 257 (million)
% 8.15/2.06  % (3719509)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=2779023637:i=4948:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/4948Mi)
% 8.15/2.06  % (3719535)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=2358405870:i=215:ep=RSTC_2997 on theBenchmark for (2997ds/215Mi)
% 8.15/2.06  % (3719535)Instruction limit reached! 
% 8.15/2.06  % (3719535)------------------------------
% 8.15/2.06  % (3719535)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.15/2.06  % (3719535)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.15/2.06  % (3719535)CaDiCaL version: 2.1.3
% 8.15/2.06  % (3719535)Termination reason: Instruction limit
% 8.15/2.06  % (3719535)Termination phase: Saturation
% 8.15/2.06  % (3719535)Time elapsed: 0.108 s
% 8.52/2.26  % (3719535)Peak memory usage: 88 MB
% 8.52/2.26  % (3719535)Instructions burned: 216 (million)
% 8.52/2.26  % (3719576)lrs+11_1_sil=16000:tgt=full:fde=none:sp=reverse_frequency:lma=off:fs=off:acc=on:bsr=unit_only:rp=on:random_seed=4293121684:avsq=on:i=317:avsqr=1,16:kws=arity_squared:add=off:fgj=on:ins=10:fsr=off:gtg=exists_sym_2994 on theBenchmark for (2994ds/317Mi)
% 8.52/2.26  % (3719447)First to succeed.
% 8.52/2.26  % (3719452)Instruction limit reached! 
% 8.52/2.26  % (3719452)------------------------------
% 8.52/2.26  % (3719452)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.52/2.26  % (3719452)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.52/2.26  % (3719452)CaDiCaL version: 2.1.3
% 8.52/2.26  % (3719452)Termination reason: Instruction limit
% 8.52/2.26  % (3719452)Termination phase: Saturation
% 8.52/2.26  % (3719452)Time elapsed: 0.695 s
% 8.52/2.26  % (3719452)Peak memory usage: 101 MB
% 8.52/2.26  % (3719452)Instructions burned: 1188 (million)
% 8.52/2.26  % (3719447)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3719436"
% 8.52/2.26  % (3719576)Instruction limit reached! 
% 8.52/2.26  % (3719576)------------------------------
% 8.52/2.26  % (3719576)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.52/2.26  % (3719576)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.52/2.26  % (3719576)CaDiCaL version: 2.1.3
% 8.52/2.26  % (3719576)Termination reason: Instruction limit
% 8.52/2.26  % (3719576)Termination phase: Saturation
% 8.52/2.26  % (3719576)Time elapsed: 0.191 s
% 8.52/2.26  % (3719576)Peak memory usage: 94 MB
% 8.52/2.26  % (3719576)Instructions burned: 317 (million)
% 8.52/2.26  % (3719446)Also succeeded, but the first one will report.
% 8.52/2.26  % (3719448)Also succeeded, but the first one will report.
% 8.52/2.26  % (3719620)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=64000:tgt=full:npcc=on:sp=arity:lcm=predicate:urr=on:s2agt=16:br=off:random_seed=610608469:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2991 on theBenchmark for (2991ds/12125Mi)
% 8.52/2.26  % (3719484)Instruction limit reached! 
% 8.52/2.26  % (3719484)------------------------------
% 8.52/2.26  % (3719484)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.52/2.26  % (3719484)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.52/2.26  % (3719484)CaDiCaL version: 2.1.3
% 8.52/2.26  % (3719484)Termination reason: Instruction limit
% 8.52/2.26  % (3719484)Termination phase: Saturation
% 8.52/2.26  % (3719484)Time elapsed: 0.747 s
% 8.52/2.26  % (3719484)Peak memory usage: 143 MB
% 8.52/2.26  % (3719484)Instructions burned: 2051 (million)
% 8.52/2.26  % (3719621)lrs+10_32_sil=8000:tgt=ground:prc=on:sp=reverse_arity:spb=non_intro:random_seed=1996107850:i=2836:kws=inv_precedence:fgj=on:bd=preordered:ins=10_2991 on theBenchmark for (2991ds/2836Mi)
% 8.52/2.26  % (3719623)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:lma=off:kmz=on:random_seed=3432336058:i=14534:kws=arity:fgj=on:bd=preordered:ins=6:ss=axioms:sgt=30_2990 on theBenchmark for (2990ds/14534Mi)
% 8.52/2.26  % (3719447)Refutation found. Thanks to Tanya!
% 8.52/2.26  % SZS status Unsatisfiable for theBenchmark
% 8.52/2.26  % SZS output start Proof for theBenchmark
% See solution above
% 8.52/2.26  % (3719447)------------------------------
% 8.52/2.26  % (3719447)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.52/2.26  % (3719447)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.52/2.26  % (3719447)CaDiCaL version: 2.1.3
% 8.52/2.26  % (3719447)Termination reason: Refutation
% 8.52/2.26  % (3719447)Time elapsed: 0.699 s
% 8.52/2.26  % (3719447)Peak memory usage: 129 MB
% 8.52/2.26  % (3719447)Instructions burned: 1065 (million)
% 8.52/2.26  % (3719447)------------------------------
% 8.52/2.26  % (3719447)------------------------------
% 8.52/2.26  % (3719436)Success in time 1.103 s
% 8.52/2.26  % Vampire exiting
%------------------------------------------------------------------------------