↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL316-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 : n013.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:57 AM UTC 2026

% Result   : Unsatisfiable 9.97s 13.51s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   32
% Syntax   : Number of formulae    :  124 ( 100 unt;  21 def)
%            Number of atoms       :  153 (  46 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   61 (  32   ~;  29   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    9 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   29 (  29 usr;  24 con; 0-2 aty)
%            Number of variables   :   96 (  96   !;   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(implies(equivalent(p,q),equivalent(implies(r,p),implies(r,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,
    ! [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(or(not(p),q)),not(or(not(q),p))))),not(or(not(or(not(or(not(r),p)),or(not(r),q))),not(or(not(or(not(r),q)),or(not(r),p))))))),
    inference(definition_unfolding,[],[f11,f6,f12,f12,f6,f6]) ).

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 = or(sF0,q),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

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

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

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

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

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

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

fof(f29,plain,
    or(sF3,p) = 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 = or(sF2,sF5),
    introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).

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

fof(f34,definition,
    sF7 = not(sF6),
    introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).

fof(f35,plain,
    not(sF6) = 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 = not(r),
    introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).

fof(f39,plain,
    not(r) = sF9,
    inference(reorient_equations,[],[f38]) ).

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

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

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

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

fof(f44,definition,
    sF12 = or(sF9,q),
    introduced(definition,[new_symbols(definition,[sF12])],[function_definition]) ).

fof(f45,plain,
    or(sF9,q) = sF12,
    inference(reorient_equations,[],[f44]) ).

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

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

fof(f48,definition,
    sF14 = not(sF13),
    introduced(definition,[new_symbols(definition,[sF14])],[function_definition]) ).

fof(f49,plain,
    not(sF13) = sF14,
    inference(reorient_equations,[],[f48]) ).

fof(f50,definition,
    sF15 = not(sF12),
    introduced(definition,[new_symbols(definition,[sF15])],[function_definition]) ).

fof(f51,plain,
    not(sF12) = sF15,
    inference(reorient_equations,[],[f50]) ).

fof(f52,definition,
    sF16 = or(sF15,sF10),
    introduced(definition,[new_symbols(definition,[sF16])],[function_definition]) ).

fof(f53,plain,
    or(sF15,sF10) = sF16,
    inference(reorient_equations,[],[f52]) ).

fof(f54,definition,
    sF17 = not(sF16),
    introduced(definition,[new_symbols(definition,[sF17])],[function_definition]) ).

fof(f55,plain,
    not(sF16) = sF17,
    inference(reorient_equations,[],[f54]) ).

fof(f56,definition,
    sF18 = or(sF14,sF17),
    introduced(definition,[new_symbols(definition,[sF18])],[function_definition]) ).

fof(f57,plain,
    or(sF14,sF17) = sF18,
    inference(reorient_equations,[],[f56]) ).

fof(f58,definition,
    sF19 = not(sF18),
    introduced(definition,[new_symbols(definition,[sF19])],[function_definition]) ).

fof(f59,plain,
    not(sF18) = sF19,
    inference(reorient_equations,[],[f58]) ).

fof(f60,definition,
    sF20 = or(sF8,sF19),
    introduced(definition,[new_symbols(definition,[sF20])],[function_definition]) ).

fof(f61,plain,
    or(sF8,sF19) = sF20,
    inference(reorient_equations,[],[f60]) ).

fof(f62,plain,
    ~ theorem(sF20),
    inference(definition_folding,[],[f19,f61,f59,f57,f55,f53,f41,f39,f51,f45,f39,f49,f47,f45,f39,f43,f41,f39,f37,f35,f33,f31,f29,f27,f25,f23,f21]) ).

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

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

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

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

fof(f185,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))),
    inference(resolution,[],[f94,f64]) ).

fof(f205,plain,
    ! [X0] : theorem(or(not(or(not(p),X0)),or(not(sF10),or(sF9,X0)))),
    inference(superposition,[],[f64,f41]) ).

fof(f208,plain,
    ! [X0] : theorem(or(not(or(not(p),X0)),or(sF11,or(sF9,X0)))),
    inference(forward_demodulation,[],[f205,f43]) ).

fof(f210,plain,
    ! [X0] : theorem(or(not(or(sF0,X0)),or(sF11,or(sF9,X0)))),
    inference(forward_demodulation,[],[f208,f21]) ).

fof(f218,plain,
    ! [X0] : theorem(or(not(or(not(q),X0)),or(not(sF12),or(sF9,X0)))),
    inference(superposition,[],[f64,f45]) ).

fof(f221,plain,
    ! [X0] : theorem(or(not(or(not(q),X0)),or(sF15,or(sF9,X0)))),
    inference(forward_demodulation,[],[f218,f51]) ).

fof(f223,plain,
    ! [X0] : theorem(or(not(or(sF3,X0)),or(sF15,or(sF9,X0)))),
    inference(forward_demodulation,[],[f221,f27]) ).

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

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

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

fof(f258,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X0,or(X2,X1)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f244,f225]) ).

fof(f264,plain,
    ! [X0,X1] :
      ( ~ theorem(or(sF7,X0))
      | theorem(or(X1,X0))
      | ~ theorem(or(X1,sF6)) ),
    inference(superposition,[],[f244,f35]) ).

fof(f269,plain,
    ! [X0,X1] :
      ( ~ theorem(or(sF17,X0))
      | theorem(or(X1,X0))
      | ~ theorem(or(X1,sF16)) ),
    inference(superposition,[],[f244,f55]) ).

fof(f361,plain,
    theorem(or(not(sF18),or(sF17,sF14))),
    inference(superposition,[],[f225,f57]) ).

fof(f364,plain,
    theorem(or(sF19,or(sF17,sF14))),
    inference(forward_demodulation,[],[f361,f59]) ).

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

fof(f392,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(X0,X2)) ),
    inference(resolution,[],[f369,f244]) ).

fof(f437,plain,
    theorem(or(not(sF5),sF6)),
    inference(superposition,[],[f369,f33]) ).

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

fof(f502,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X0,or(X1,X1)))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f501,f244]) ).

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

fof(f510,plain,
    ! [X0] : theorem(or(not(X0),X0)),
    inference(resolution,[],[f502,f369]) ).

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

fof(f616,plain,
    ! [X0,X1] :
      ( theorem(or(not(or(sF14,X0)),or(X1,X0)))
      | ~ theorem(or(X1,sF13)) ),
    inference(superposition,[],[f549,f49]) ).

fof(f631,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f392,f258]) ).

fof(f723,plain,
    ! [X0] : theorem(or(X0,not(X0))),
    inference(resolution,[],[f510,f234]) ).

fof(f757,plain,
    theorem(or(sF17,or(sF19,sF14))),
    inference(resolution,[],[f364,f94]) ).

fof(f975,plain,
    ! [X0] :
      ( theorem(or(X0,not(sF7)))
      | ~ theorem(or(X0,sF6)) ),
    inference(resolution,[],[f264,f723]) ).

fof(f976,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF6))
      | theorem(or(X0,sF8)) ),
    inference(forward_demodulation,[],[f975,f37]) ).

fof(f995,plain,
    theorem(or(sF17,or(sF14,sF19))),
    inference(resolution,[],[f757,f258]) ).

fof(f1154,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF2))
      | theorem(or(X0,sF6)) ),
    inference(superposition,[],[f631,f33]) ).

fof(f1156,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF8))
      | theorem(or(X0,sF20)) ),
    inference(superposition,[],[f631,f61]) ).

fof(f1338,plain,
    theorem(or(not(or(sF3,p)),or(sF15,sF10))),
    inference(superposition,[],[f223,f41]) ).

fof(f1340,plain,
    theorem(or(not(or(sF3,p)),sF16)),
    inference(forward_demodulation,[],[f1338,f53]) ).

fof(f1342,plain,
    theorem(or(not(sF4),sF16)),
    inference(forward_demodulation,[],[f1340,f29]) ).

fof(f1344,plain,
    theorem(or(sF5,sF16)),
    inference(forward_demodulation,[],[f1342,f31]) ).

fof(f1347,plain,
    theorem(or(sF16,sF5)),
    inference(resolution,[],[f1344,f234]) ).

fof(f1366,plain,
    theorem(or(not(or(sF0,q)),or(sF11,sF12))),
    inference(superposition,[],[f210,f45]) ).

fof(f1367,plain,
    theorem(or(not(or(sF0,q)),sF13)),
    inference(forward_demodulation,[],[f1366,f47]) ).

fof(f1369,plain,
    theorem(or(not(sF1),sF13)),
    inference(forward_demodulation,[],[f1367,f23]) ).

fof(f1371,plain,
    theorem(or(sF2,sF13)),
    inference(forward_demodulation,[],[f1369,f25]) ).

fof(f1374,plain,
    theorem(or(sF13,sF2)),
    inference(resolution,[],[f1371,f234]) ).

fof(f1586,plain,
    theorem(or(not(sF5),sF8)),
    inference(resolution,[],[f437,f976]) ).

fof(f1592,plain,
    theorem(or(not(sF5),sF20)),
    inference(resolution,[],[f1586,f1156]) ).

fof(f1595,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF5))
      | theorem(or(X0,sF20)) ),
    inference(resolution,[],[f1592,f244]) ).

fof(f1601,plain,
    theorem(or(sF16,sF20)),
    inference(resolution,[],[f1595,f1347]) ).

fof(f1603,plain,
    theorem(or(sF20,sF16)),
    inference(resolution,[],[f1601,f234]) ).

fof(f1897,plain,
    theorem(or(sF13,sF6)),
    inference(resolution,[],[f1154,f1374]) ).

fof(f1898,plain,
    theorem(or(sF13,sF8)),
    inference(resolution,[],[f1897,f976]) ).

fof(f1901,plain,
    theorem(or(sF8,sF13)),
    inference(resolution,[],[f1898,f234]) ).

fof(f2317,plain,
    ( theorem(or(not(or(sF14,sF19)),sF20))
    | ~ theorem(or(sF8,sF13)) ),
    inference(superposition,[],[f616,f61]) ).

fof(f2347,plain,
    theorem(or(not(or(sF14,sF19)),sF20)),
    inference(forward_subsumption_resolution,[],[f2317,f1901]) ).

fof(f2370,plain,
    ! [X0] :
      ( ~ theorem(or(X0,or(sF14,sF19)))
      | theorem(or(X0,sF20)) ),
    inference(resolution,[],[f2347,f244]) ).

fof(f2391,plain,
    theorem(or(sF17,sF20)),
    inference(resolution,[],[f2370,f995]) ).

fof(f2393,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF16))
      | theorem(or(X0,sF20)) ),
    inference(resolution,[],[f2391,f269]) ).

fof(f2406,plain,
    theorem(or(sF20,sF20)),
    inference(resolution,[],[f2393,f1603]) ).

fof(f2412,plain,
    theorem(sF20),
    inference(resolution,[],[f2406,f503]) ).

fof(f2414,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f2412,f62]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL316-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/10.83  % Computer : n013.cluster.edu
% 0.12/10.83  % Model    : x86_64 x86_64
% 0.12/10.83  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/10.83  % Memory   : 8046.5625MB
% 0.12/10.83  % OS       : Linux 6.8.0-71-generic
% 0.12/10.83  % CPULimit : 300
% 0.12/10.83  % WCLimit  : 300
% 0.12/10.83  % DateTime : Sun Sep 27 15:33:35 UTC 2026
% 0.12/10.83  % CPUTime  : 
% 0.12/10.83  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/10.86  Running first-order theorem proving
% 0.12/10.87  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.97/13.50  % (359430)Input is clausal, will run a generic CNF schedule.
% 9.97/13.50  % (359439)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2503174392:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 9.97/13.50  % (359440)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=445916489:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 9.97/13.50  % (359438)lrs+10_1_sil=8000:sp=occurrence:random_seed=2565960303:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 9.97/13.50  % (359436)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=266798181:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 9.97/13.50  % (359437)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3985749199:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 9.97/13.50  % (359435)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=2279173666:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 9.97/13.50  % (359441)dis-21_1_sil=8000:lcm=predicate:random_seed=2546757826: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.97/13.50  % (359439)Instruction limit reached! 
% 9.97/13.50  % (359439)------------------------------
% 9.97/13.50  % (359439)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.97/13.50  % (359439)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.97/13.50  % (359439)CaDiCaL version: 2.1.3
% 9.97/13.50  % (359439)Termination reason: Instruction limit
% 9.97/13.50  % (359439)Termination phase: Saturation
% 9.97/13.50  % (359439)Time elapsed: 0.039 s
% 9.97/13.50  % (359439)Peak memory usage: 88 MB
% 9.97/13.50  % (359439)Instructions burned: 115 (million)
% 9.97/13.50  % (359441)Instruction limit reached! 
% 9.97/13.50  % (359441)------------------------------
% 9.97/13.50  % (359441)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.97/13.50  % (359441)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.97/13.50  % (359441)CaDiCaL version: 2.1.3
% 9.97/13.50  % (359441)Termination reason: Instruction limit
% 9.97/13.50  % (359441)Termination phase: Saturation
% 9.97/13.50  % (359441)Time elapsed: 0.060 s
% 9.97/13.50  % (359441)Peak memory usage: 87 MB
% 9.97/13.50  % (359441)Instructions burned: 119 (million)
% 9.97/13.50  % (359438)Instruction limit reached! 
% 9.97/13.50  % (359438)------------------------------
% 9.97/13.50  % (359438)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.97/13.50  % (359438)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.97/13.50  % (359438)CaDiCaL version: 2.1.3
% 9.97/13.50  % (359438)Termination reason: Instruction limit
% 9.97/13.50  % (359438)Termination phase: Saturation
% 9.97/13.50  % (359438)Time elapsed: 0.070 s
% 9.97/13.50  % (359438)Peak memory usage: 89 MB
% 9.97/13.50  % (359438)Instructions burned: 108 (million)
% 9.97/13.50  % (359440)Instruction limit reached! 
% 9.97/13.50  % (359440)------------------------------
% 9.97/13.50  % (359440)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.97/13.50  % (359440)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.97/13.51  % (359440)CaDiCaL version: 2.1.3
% 9.97/13.51  % (359440)Termination reason: Instruction limit
% 9.97/13.51  % (359440)Termination phase: Saturation
% 9.97/13.51  % (359440)Time elapsed: 0.118 s
% 9.97/13.51  % (359440)Peak memory usage: 89 MB
% 9.97/13.51  % (359440)Instructions burned: 181 (million)
% 9.97/13.51  % (359460)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=1180586117:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 9.97/13.51  % (359460)Refutation not found, incomplete strategy
% 9.97/13.51  % (359460)------------------------------
% 9.97/13.51  % (359460)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.97/13.51  % (359460)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.97/13.51  % (359460)CaDiCaL version: 2.1.3
% 9.97/13.51  % (359460)Termination reason: Refutation not found, incomplete strategy
% 9.97/13.51  % (359460)Time elapsed: 0.001 s
% 9.97/13.51  % (359460)Peak memory usage: 88 MB
% 9.97/13.51  % (359462)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=3007603033:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 9.97/13.51  % (359461)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=1636095463: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.97/13.51  % (359461)Refutation not found, incomplete strategy
% 9.97/13.51  % (359461)------------------------------
% 9.97/13.51  % (359461)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.97/13.51  % (359462)Refutation not found, incomplete strategy
% 9.97/13.51  % (359462)------------------------------
% 9.97/13.51  % (359462)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.97/13.51  % (359462)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.97/13.51  % (359461)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.97/13.51  % (359462)CaDiCaL version: 2.1.3
% 9.97/13.51  % (359461)CaDiCaL version: 2.1.3
% 9.97/13.51  % (359461)Termination reason: Refutation not found, incomplete strategy
% 9.97/13.51  % (359461)Time elapsed: 0.001 s
% 9.97/13.51  % (359462)Termination reason: Refutation not found, incomplete strategy
% 9.97/13.51  % (359462)Time elapsed: 0.001 s
% 9.97/13.51  % (359461)Peak memory usage: 87 MB
% 9.97/13.51  % (359462)Peak memory usage: 87 MB
% 9.97/13.51  % (359463)lrs+10_64_to=lpo:sil=8000:random_seed=3409616192:i=126:bd=preordered_2997 on theBenchmark for (2997ds/126Mi)
% 9.97/13.51  % (359460)------------------------------
% 9.97/13.51  % (359460)------------------------------
% 9.97/13.51  % (359463)Instruction limit reached! 
% 9.97/13.51  % (359463)------------------------------
% 9.97/13.51  % (359463)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.97/13.51  % (359463)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.97/13.51  % (359463)CaDiCaL version: 2.1.3
% 9.97/13.51  % (359463)Termination reason: Instruction limit
% 9.97/13.51  % (359463)Termination phase: Saturation
% 9.97/13.51  % (359463)Time elapsed: 0.091 s
% 9.97/13.51  % (359463)Peak memory usage: 89 MB
% 9.97/13.51  % (359463)Instructions burned: 126 (million)
% 9.97/13.51  % (359481)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=3665805576:avsq=on:i=194:fgj=on:bd=preordered_2995 on theBenchmark for (2995ds/194Mi)
% 9.97/13.51  % (359462)------------------------------
% 9.97/13.51  % (359462)------------------------------
% 9.97/13.51  % (359461)------------------------------
% 9.97/13.51  % (359461)------------------------------
% 9.97/13.51  % (359481)Instruction limit reached! 
% 9.97/13.51  % (359481)------------------------------
% 9.97/13.51  % (359481)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.97/13.51  % (359481)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.97/13.51  % (359481)CaDiCaL version: 2.1.3
% 9.97/13.51  % (359481)Termination reason: Instruction limit
% 9.97/13.51  % (359481)Termination phase: Saturation
% 9.97/13.51  % (359481)Time elapsed: 0.113 s
% 9.97/13.51  % (359481)Peak memory usage: 90 MB
% 9.97/13.51  % (359481)Instructions burned: 195 (million)
% 9.97/13.51  % (359500)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=4183652369:i=157:gtg=all_2994 on theBenchmark for (2994ds/157Mi)
% 9.97/13.51  % (359500)Instruction limit reached! 
% 9.97/13.51  % (359500)------------------------------
% 9.97/13.51  % (359500)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.97/13.51  % (359500)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.97/13.51  % (359500)CaDiCaL version: 2.1.3
% 9.97/13.51  % (359500)Termination reason: Instruction limit
% 9.97/13.51  % (359500)Termination phase: Saturation
% 9.97/13.51  % (359500)Time elapsed: 0.164 s
% 9.97/13.51  % (359500)Peak memory usage: 91 MB
% 9.97/13.51  % (359500)Instructions burned: 157 (million)
% 9.97/13.51  % (359504)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=1184035440:i=107_2992 on theBenchmark for (2992ds/107Mi)
% 9.97/13.51  % (359504)Refutation not found, incomplete strategy
% 9.97/13.51  % (359504)------------------------------
% 9.97/13.51  % (359504)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.97/13.51  % (359504)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.97/13.51  % (359504)CaDiCaL version: 2.1.3
% 9.97/13.51  % (359504)Termination reason: Refutation not found, incomplete strategy
% 9.97/13.51  % (359504)Time elapsed: 0.001 s
% 9.97/13.51  % (359504)Peak memory usage: 87 MB
% 9.97/13.51  % (359502)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=3508639292:i=3394:sd=4:ss=included:sgt=64_2992 on theBenchmark for (2992ds/3394Mi)
% 9.97/13.51  % (359503)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=246951035:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2992 on theBenchmark for (2992ds/106Mi)
% 9.97/13.51  % (359503)Instruction limit reached! 
% 9.97/13.51  % (359503)------------------------------
% 9.97/13.51  % (359503)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.97/13.51  % (359503)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.97/13.51  % (359503)CaDiCaL version: 2.1.3
% 9.97/13.51  % (359503)Termination reason: Instruction limit
% 9.97/13.51  % (359503)Termination phase: Saturation
% 9.97/13.51  % (359503)Time elapsed: 0.095 s
% 9.97/13.51  % (359503)Peak memory usage: 89 MB
% 9.97/13.51  % (359503)Instructions burned: 106 (million)
% 9.97/13.51  % (359504)------------------------------
% 9.97/13.51  % (359504)------------------------------
% 9.97/13.51  % (359507)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=2099737949:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2989 on theBenchmark for (2989ds/242Mi)
% 9.97/13.51  % (359510)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=861770492:cond=fast:i=5208:av=off_2988 on theBenchmark for (2988ds/5208Mi)
% 9.97/13.51  % (359511)lrs+1011_16_sil=32000:erd=off:bce=on:random_seed=2660550203:i=134:sd=2:doe=on:ss=axioms:sgt=14_2987 on theBenchmark for (2987ds/134Mi)
% 9.97/13.51  % (359511)Instruction limit reached! 
% 9.97/13.51  % (359511)------------------------------
% 9.97/13.51  % (359511)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.97/13.51  % (359511)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.97/13.51  % (359511)CaDiCaL version: 2.1.3
% 9.97/13.51  % (359511)Termination reason: Instruction limit
% 9.97/13.51  % (359511)Termination phase: Saturation
% 9.97/13.51  % (359511)Time elapsed: 0.073 s
% 9.97/13.51  % (359511)Peak memory usage: 90 MB
% 9.97/13.51  % (359511)Instructions burned: 135 (million)
% 9.97/13.51  % (359507)Instruction limit reached! 
% 9.97/13.51  % (359507)------------------------------
% 9.97/13.51  % (359507)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.97/13.51  % (359507)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.97/13.51  % (359507)CaDiCaL version: 2.1.3
% 9.97/13.51  % (359507)Termination reason: Instruction limit
% 9.97/13.51  % (359507)Termination phase: Saturation
% 9.97/13.51  % (359507)Time elapsed: 0.262 s
% 9.97/13.51  % (359507)Peak memory usage: 90 MB
% 9.97/13.51  % (359507)Instructions burned: 243 (million)
% 9.97/13.51  % (359435)First to succeed.
% 9.97/13.51  % (359435)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-359430"
% 9.97/13.51  % (359515)ott+10_5:4_to=lpo:sil=8000:prc=on:fde=unused:sp=unary_frequency:spb=goal:urr=on:random_seed=2430750259:i=499:bd=all_2984 on theBenchmark for (2984ds/499Mi)
% 9.97/13.51  % (359516)lrs+10_64_to=lpo:sil=8000:prc=on:sp=reverse_frequency:nwc=5:alpa=false:flr=on:random_seed=2841582592:i=191:fgj=on:bd=all_2984 on theBenchmark for (2984ds/191Mi)
% 9.97/13.51  % (359515)Instruction limit reached! 
% 9.97/13.51  % (359515)------------------------------
% 9.97/13.51  % (359515)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.97/13.51  % (359515)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.97/13.51  % (359515)CaDiCaL version: 2.1.3
% 9.97/13.51  % (359515)Termination reason: Instruction limit
% 9.97/13.51  % (359515)Termination phase: Saturation
% 9.97/13.51  % (359515)Time elapsed: 0.256 s
% 9.97/13.51  % (359515)Peak memory usage: 94 MB
% 9.97/13.51  % (359515)Instructions burned: 499 (million)
% 9.97/13.51  % (359516)Instruction limit reached! 
% 9.97/13.51  % (359516)------------------------------
% 9.97/13.51  % (359516)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.97/13.51  % (359516)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.97/13.51  % (359516)CaDiCaL version: 2.1.3
% 9.97/13.51  % (359516)Termination reason: Instruction limit
% 9.97/13.51  % (359516)Termination phase: Saturation
% 9.97/13.51  % (359516)Time elapsed: 0.208 s
% 9.97/13.51  % (359516)Peak memory usage: 93 MB
% 9.97/13.51  % (359516)Instructions burned: 191 (million)
% 9.97/13.51  % (359435)Refutation found. Thanks to Tanya!
% 9.97/13.51  % SZS status Unsatisfiable for theBenchmark
% 9.97/13.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/13.70  % (359435)------------------------------
% 0.17/13.70  % (359435)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.17/13.70  % (359435)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/13.70  % (359435)CaDiCaL version: 2.1.3
% 0.17/13.70  % (359435)Termination reason: Refutation
% 0.17/13.70  % (359435)Time elapsed: 1.555 s
% 0.17/13.70  % (359435)Peak memory usage: 134 MB
% 0.17/13.70  % (359435)Instructions burned: 1573 (million)
% 0.17/13.70  % (359435)------------------------------
% 0.17/13.70  % (359435)------------------------------
% 0.17/13.70  % (359430)Success in time 2.196 s
% 0.17/13.70  % Vampire exiting
%------------------------------------------------------------------------------