↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n005.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:40:09 AM UTC 2026

% Result   : Theorem 4.27s 1.58s
% Output   : Refutation 5.90s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   71 (  62 unt;   0 def)
%            Number of atoms       :   82 (  56 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   38 (  27   ~;   8   |;   1   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :  108 ( 107   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : addition(X0,X1) = addition(X1,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_commutativity) ).

fof(f2,axiom,
    ! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_associativity) ).

fof(f4,axiom,
    ! [X0] : addition(X0,X0) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_idempotence) ).

fof(f5,axiom,
    ! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_associativity) ).

fof(f6,axiom,
    ! [X0] : multiplication(X0,one) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_right_identity) ).

fof(f7,axiom,
    ! [X0] : multiplication(one,X0) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_left_identity) ).

fof(f8,axiom,
    ! [X0,X1,X2] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_distributivity) ).

fof(f9,axiom,
    ! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_distributivity) ).

fof(f12,axiom,
    ! [X0,X1] :
      ( leq(X0,X1)
    <=> addition(X0,X1) = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',order) ).

fof(f14,axiom,
    ! [X0] : leq(addition(one,multiplication(star(X0),X0)),star(X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',star_unfold_left) ).

fof(f16,axiom,
    ! [X0,X1,X2] :
      ( leq(addition(multiplication(X0,X1),X2),X0)
     => leq(multiplication(X2,star(X1)),X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',star_induction_right) ).

fof(f17,conjecture,
    ! [X0] : leq(star(X0),addition(one,multiplication(X0,star(X0)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(f18,negated_conjecture,
    ~ ! [X0] : leq(star(X0),addition(one,multiplication(X0,star(X0)))),
    inference(negated_conjecture,[status(cth)],[f17]) ).

fof(f19,plain,
    ? [X0] : ~ leq(star(X0),addition(one,multiplication(X0,star(X0)))),
    inference(ennf_transformation,[],[f18]) ).

fof(f20,plain,
    ! [X0,X1,X2] :
      ( leq(multiplication(X2,star(X1)),X0)
      | ~ leq(addition(multiplication(X0,X1),X2),X0) ),
    inference(ennf_transformation,[],[f16]) ).

fof(f22,plain,
    ~ leq(star(sK0),addition(one,multiplication(sK0,star(sK0)))),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f19]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( ( leq(X0,X1)
        | addition(X0,X1) != X1 )
      & ( addition(X0,X1) = X1
        | ~ leq(X0,X1) ) ),
    inference(nnf_transformation,[],[f12]) ).

fof(f24,plain,
    ~ leq(star(sK0),addition(one,multiplication(sK0,star(sK0)))),
    inference(cnf_transformation,[],[f22]) ).

fof(f25,plain,
    ! [X2,X0,X1] :
      ( leq(multiplication(X2,star(X1)),X0)
      | ~ leq(addition(multiplication(X0,X1),X2),X0) ),
    inference(cnf_transformation,[],[f20]) ).

fof(f27,plain,
    ! [X0] : leq(addition(one,multiplication(star(X0),X0)),star(X0)),
    inference(cnf_transformation,[],[f14]) ).

fof(f29,plain,
    ! [X0,X1] :
      ( ~ leq(X0,X1)
      | addition(X0,X1) = X1 ),
    inference(cnf_transformation,[],[f23]) ).

fof(f30,plain,
    ! [X0,X1] :
      ( leq(X0,X1)
      | addition(X0,X1) != X1 ),
    inference(cnf_transformation,[],[f23]) ).

fof(f31,plain,
    ! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
    inference(cnf_transformation,[],[f9]) ).

fof(f32,plain,
    ! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
    inference(cnf_transformation,[],[f8]) ).

fof(f33,plain,
    ! [X0] : addition(X0,X0) = X0,
    inference(cnf_transformation,[],[f4]) ).

fof(f35,plain,
    ! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
    inference(cnf_transformation,[],[f2]) ).

fof(f36,plain,
    ! [X0,X1] : addition(X0,X1) = addition(X1,X0),
    inference(cnf_transformation,[],[f1]) ).

fof(f39,plain,
    ! [X0] : multiplication(one,X0) = X0,
    inference(cnf_transformation,[],[f7]) ).

fof(f40,plain,
    ! [X0] : multiplication(X0,one) = X0,
    inference(cnf_transformation,[],[f6]) ).

fof(f41,plain,
    ! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
    inference(cnf_transformation,[],[f5]) ).

fof(f52,plain,
    ! [X0] : star(X0) = addition(addition(one,multiplication(star(X0),X0)),star(X0)),
    inference(resolution,[],[f27,f29]) ).

fof(f56,plain,
    ! [X0] : star(X0) = addition(star(X0),addition(one,multiplication(star(X0),X0))),
    inference(forward_demodulation,[],[f52,f36]) ).

fof(f65,plain,
    ! [X0,X1] : addition(X0,X1) = addition(X0,addition(X0,X1)),
    inference(superposition,[],[f35,f33]) ).

fof(f68,plain,
    ! [X2,X0,X1] : addition(addition(X0,X1),X2) = addition(X1,addition(X0,X2)),
    inference(superposition,[],[f35,f36]) ).

fof(f78,plain,
    ! [X2,X0,X1] : addition(X0,addition(X1,X2)) = addition(X2,addition(X0,X1)),
    inference(superposition,[],[f36,f35]) ).

fof(f105,plain,
    ! [X0,X1] :
      ( leq(star(X0),X1)
      | ~ leq(addition(multiplication(X1,X0),one),X1) ),
    inference(superposition,[],[f25,f39]) ).

fof(f106,plain,
    ! [X0,X1] :
      ( leq(star(X0),X1)
      | ~ leq(addition(one,multiplication(X1,X0)),X1) ),
    inference(forward_demodulation,[],[f105,f36]) ).

fof(f122,plain,
    ! [X0,X1] : multiplication(addition(one,X1),X0) = addition(X0,multiplication(X1,X0)),
    inference(superposition,[],[f31,f39]) ).

fof(f147,plain,
    ! [X0,X1] : multiplication(X0,addition(one,X1)) = addition(X0,multiplication(X0,X1)),
    inference(superposition,[],[f32,f40]) ).

fof(f186,plain,
    ! [X0,X1] : addition(X0,X1) = addition(X1,addition(X0,X1)),
    inference(superposition,[],[f65,f36]) ).

fof(f221,plain,
    ! [X2,X0,X1] : addition(addition(X0,X1),X2) = addition(X1,addition(addition(X0,X1),X2)),
    inference(superposition,[],[f35,f186]) ).

fof(f224,plain,
    ! [X2,X0,X1] : addition(X0,addition(X1,X2)) = addition(X1,addition(X0,addition(X1,X2))),
    inference(forward_demodulation,[],[f221,f35]) ).

fof(f235,plain,
    ! [X2,X3,X0,X1] : addition(addition(X0,addition(X1,X2)),X3) = addition(X2,addition(addition(X0,X1),X3)),
    inference(superposition,[],[f68,f35]) ).

fof(f270,plain,
    ! [X2,X3,X0,X1] : addition(addition(X0,addition(X1,X2)),X3) = addition(X2,addition(X0,addition(X1,X3))),
    inference(forward_demodulation,[],[f235,f35]) ).

fof(f280,plain,
    ! [X2,X3,X0,X1] : addition(X0,addition(addition(X1,X2),X3)) = addition(X2,addition(X0,addition(X1,X3))),
    inference(forward_demodulation,[],[f270,f35]) ).

fof(f286,plain,
    ! [X2,X3,X0,X1] : addition(X0,addition(X1,addition(X2,X3))) = addition(X2,addition(X0,addition(X1,X3))),
    inference(forward_demodulation,[],[f280,f35]) ).

fof(f536,plain,
    ~ leq(addition(one,multiplication(addition(one,multiplication(sK0,star(sK0))),sK0)),addition(one,multiplication(sK0,star(sK0)))),
    inference(resolution,[],[f106,f24]) ).

fof(f538,plain,
    ~ leq(addition(one,addition(sK0,multiplication(multiplication(sK0,star(sK0)),sK0))),addition(one,multiplication(sK0,star(sK0)))),
    inference(forward_demodulation,[],[f536,f122]) ).

fof(f539,plain,
    ~ leq(addition(one,addition(sK0,multiplication(sK0,multiplication(star(sK0),sK0)))),addition(one,multiplication(sK0,star(sK0)))),
    inference(forward_demodulation,[],[f538,f41]) ).

fof(f540,plain,
    addition(one,multiplication(sK0,star(sK0))) != addition(addition(one,addition(sK0,multiplication(sK0,multiplication(star(sK0),sK0)))),addition(one,multiplication(sK0,star(sK0)))),
    inference(resolution,[],[f539,f30]) ).

fof(f541,plain,
    addition(one,multiplication(sK0,star(sK0))) != addition(addition(one,multiplication(sK0,star(sK0))),addition(one,addition(sK0,multiplication(sK0,multiplication(star(sK0),sK0))))),
    inference(forward_demodulation,[],[f540,f36]) ).

fof(f542,plain,
    addition(one,multiplication(sK0,star(sK0))) != addition(one,addition(addition(sK0,multiplication(sK0,multiplication(star(sK0),sK0))),addition(one,multiplication(sK0,star(sK0))))),
    inference(forward_demodulation,[],[f541,f78]) ).

fof(f543,plain,
    addition(one,multiplication(sK0,star(sK0))) != addition(addition(sK0,multiplication(sK0,multiplication(star(sK0),sK0))),addition(one,multiplication(sK0,star(sK0)))),
    inference(forward_demodulation,[],[f542,f224]) ).

fof(f544,plain,
    addition(one,multiplication(sK0,star(sK0))) != addition(addition(one,multiplication(sK0,star(sK0))),addition(sK0,multiplication(sK0,multiplication(star(sK0),sK0)))),
    inference(forward_demodulation,[],[f543,f36]) ).

fof(f545,plain,
    addition(one,multiplication(sK0,star(sK0))) != addition(sK0,addition(multiplication(sK0,multiplication(star(sK0),sK0)),addition(one,multiplication(sK0,star(sK0))))),
    inference(forward_demodulation,[],[f544,f78]) ).

fof(f546,plain,
    addition(one,multiplication(sK0,star(sK0))) != addition(one,addition(sK0,addition(multiplication(sK0,multiplication(star(sK0),sK0)),multiplication(sK0,star(sK0))))),
    inference(forward_demodulation,[],[f545,f286]) ).

fof(f547,plain,
    addition(one,multiplication(sK0,star(sK0))) != addition(one,addition(sK0,addition(multiplication(sK0,star(sK0)),multiplication(sK0,multiplication(star(sK0),sK0))))),
    inference(forward_demodulation,[],[f546,f36]) ).

fof(f548,plain,
    addition(one,multiplication(sK0,star(sK0))) != addition(one,addition(sK0,multiplication(sK0,addition(star(sK0),multiplication(star(sK0),sK0))))),
    inference(forward_demodulation,[],[f547,f32]) ).

fof(f549,plain,
    addition(one,multiplication(sK0,star(sK0))) != addition(one,addition(sK0,multiplication(sK0,multiplication(star(sK0),addition(one,sK0))))),
    inference(forward_demodulation,[],[f548,f147]) ).

fof(f1061,plain,
    ! [X0] : star(X0) = addition(one,addition(multiplication(star(X0),X0),star(X0))),
    inference(superposition,[],[f78,f56]) ).

fof(f1077,plain,
    ! [X0] : star(X0) = addition(one,addition(star(X0),multiplication(star(X0),X0))),
    inference(forward_demodulation,[],[f1061,f36]) ).

fof(f1087,plain,
    ! [X0] : star(X0) = addition(one,multiplication(star(X0),addition(one,X0))),
    inference(forward_demodulation,[],[f1077,f147]) ).

fof(f3502,plain,
    ! [X0] : star(X0) = addition(one,star(X0)),
    inference(superposition,[],[f65,f1087]) ).

fof(f3507,plain,
    ! [X0] : star(X0) = addition(multiplication(star(X0),addition(one,X0)),star(X0)),
    inference(superposition,[],[f186,f1087]) ).

fof(f3518,plain,
    ! [X0] : star(X0) = addition(star(X0),multiplication(star(X0),addition(one,X0))),
    inference(forward_demodulation,[],[f3507,f36]) ).

fof(f3530,plain,
    ! [X0] : star(X0) = multiplication(star(X0),addition(one,addition(one,X0))),
    inference(forward_demodulation,[],[f3518,f147]) ).

fof(f3534,plain,
    ! [X0] : star(X0) = multiplication(star(X0),addition(one,X0)),
    inference(forward_demodulation,[],[f3530,f65]) ).

fof(f3790,plain,
    ! [X0,X1] : multiplication(X1,star(X0)) = addition(X1,multiplication(X1,star(X0))),
    inference(superposition,[],[f147,f3502]) ).

fof(f4074,plain,
    addition(one,multiplication(sK0,star(sK0))) != addition(one,addition(sK0,multiplication(sK0,star(sK0)))),
    inference(superposition,[],[f549,f3534]) ).

fof(f4118,plain,
    addition(one,multiplication(sK0,star(sK0))) != addition(one,multiplication(sK0,star(sK0))),
    inference(forward_demodulation,[],[f4074,f3790]) ).

fof(f4119,plain,
    $false,
    inference(trivial_inequality_removal,[],[f4118]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KLE036+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.35  % Computer : n005.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sun Sep 27 13:03:32 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38  Running first-order theorem proving
% 0.12/0.38  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
% 4.27/1.58  % (3973420)Detected formulas, will run a generic FOF schedule.
% 4.27/1.58  % (3973429)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2061473294:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.27/1.58  % (3973430)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=751870248:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.27/1.58  % (3973428)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=714737010:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.27/1.58  % (3973425)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=2044132929:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.27/1.58  % (3973427)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1700869267:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.27/1.58  % (3973431)dis-21_1_sil=8000:lcm=predicate:random_seed=4241041243:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 4.27/1.58  % (3973426)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=1333555667:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.27/1.58  % (3973431)Refutation not found, incomplete strategy
% 4.27/1.58  % (3973431)------------------------------
% 4.27/1.58  % (3973431)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.27/1.58  % (3973431)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.27/1.58  % (3973431)CaDiCaL version: 2.1.3
% 4.27/1.58  % (3973431)Termination reason: Refutation not found, incomplete strategy
% 4.27/1.58  % (3973431)Time elapsed: 0.002 s
% 4.27/1.58  % (3973428)Refutation not found, incomplete strategy
% 4.27/1.58  % (3973428)------------------------------
% 4.27/1.58  % (3973428)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.27/1.58  % (3973431)Peak memory usage: 88 MB
% 4.27/1.58  % (3973431)Instructions burned: 1 (million)
% 4.27/1.58  % (3973428)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.27/1.58  % (3973428)CaDiCaL version: 2.1.3
% 4.27/1.58  % (3973428)Termination reason: Refutation not found, incomplete strategy
% 4.27/1.58  % (3973428)Time elapsed: 0.002 s
% 4.27/1.58  % (3973428)Peak memory usage: 88 MB
% 4.27/1.58  % (3973428)Instructions burned: 1 (million)
% 4.27/1.58  % (3973429)Instruction limit reached! 
% 4.27/1.58  % (3973429)------------------------------
% 4.27/1.58  % (3973429)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.27/1.58  % (3973429)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.27/1.58  % (3973429)CaDiCaL version: 2.1.3
% 4.27/1.58  % (3973429)Termination reason: Instruction limit
% 4.27/1.58  % (3973429)Termination phase: Saturation
% 4.27/1.58  % (3973429)Time elapsed: 0.040 s
% 4.27/1.58  % (3973429)Peak memory usage: 89 MB
% 4.27/1.58  % (3973429)Instructions burned: 125 (million)
% 4.27/1.58  % (3973430)Instruction limit reached! 
% 4.27/1.58  % (3973430)------------------------------
% 4.27/1.58  % (3973430)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.27/1.58  % (3973430)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.27/1.58  % (3973430)CaDiCaL version: 2.1.3
% 4.27/1.58  % (3973430)Termination reason: Instruction limit
% 4.27/1.58  % (3973430)Termination phase: Saturation
% 4.27/1.58  % (3973430)Time elapsed: 0.086 s
% 4.27/1.58  % (3973430)Peak memory usage: 89 MB
% 4.27/1.58  % (3973430)Instructions burned: 140 (million)
% 4.27/1.58  % (3973439)lrs+10_1_sil=8000:sp=occurrence:random_seed=3177678980:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 4.27/1.58  % (3973431)------------------------------
% 4.27/1.58  % (3973431)------------------------------
% 4.27/1.58  % (3973428)------------------------------
% 4.27/1.58  % (3973428)------------------------------
% 4.27/1.58  % (3973439)Instruction limit reached! 
% 4.27/1.58  % (3973439)------------------------------
% 4.27/1.58  % (3973439)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.27/1.58  % (3973439)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.27/1.58  % (3973439)CaDiCaL version: 2.1.3
% 4.27/1.58  % (3973439)Termination reason: Instruction limit
% 4.27/1.58  % (3973439)Termination phase: Saturation
% 4.27/1.58  % (3973439)Time elapsed: 0.098 s
% 4.27/1.58  % (3973439)Peak memory usage: 91 MB
% 4.27/1.58  % (3973439)Instructions burned: 288 (million)
% 4.27/1.58  % (3973440)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2110247828:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 4.27/1.58  % (3973440)Instruction limit reached! 
% 4.27/1.58  % (3973440)------------------------------
% 4.27/1.58  % (3973440)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.27/1.58  % (3973440)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.27/1.58  % (3973440)CaDiCaL version: 2.1.3
% 4.27/1.58  % (3973440)Termination reason: Instruction limit
% 4.27/1.58  % (3973440)Termination phase: Saturation
% 4.27/1.58  % (3973440)Time elapsed: 0.103 s
% 4.27/1.58  % (3973440)Peak memory usage: 90 MB
% 4.27/1.58  % (3973440)Instructions burned: 157 (million)
% 4.27/1.58  % (3973443)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1158073374:i=325:sd=1:ss=axioms:sgt=32_2995 on theBenchmark for (2995ds/325Mi)
% 4.27/1.58  % (3973444)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=860478370:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 4.27/1.58  % (3973445)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=3981383669:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 4.27/1.58  % (3973445)Refutation not found, incomplete strategy
% 4.27/1.58  % (3973445)------------------------------
% 4.27/1.58  % (3973445)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.27/1.58  % (3973445)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.27/1.58  % (3973445)CaDiCaL version: 2.1.3
% 4.27/1.58  % (3973445)Termination reason: Refutation not found, incomplete strategy
% 4.27/1.58  % (3973445)Time elapsed: 0.002 s
% 4.27/1.58  % (3973445)Peak memory usage: 88 MB
% 4.27/1.58  % (3973445)Instructions burned: 1 (million)
% 4.27/1.58  % (3973443)First to succeed.
% 4.27/1.58  % (3973443)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3973420"
% 4.27/1.58  % (3973446)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=3774669266:i=2350_2994 on theBenchmark for (2994ds/2350Mi)
% 4.27/1.58  % (3973444)Instruction limit reached! 
% 4.27/1.58  % (3973444)------------------------------
% 4.27/1.58  % (3973444)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.27/1.58  % (3973444)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.27/1.58  % (3973444)CaDiCaL version: 2.1.3
% 4.27/1.58  % (3973444)Termination reason: Instruction limit
% 4.27/1.58  % (3973444)Termination phase: Saturation
% 4.27/1.58  % (3973444)Time elapsed: 0.157 s
% 4.27/1.58  % (3973444)Peak memory usage: 90 MB
% 4.27/1.58  % (3973444)Instructions burned: 249 (million)
% 4.27/1.58  % (3973443)Refutation found. Thanks to Tanya!
% 4.27/1.58  % SZS status Theorem for theBenchmark
% 4.27/1.58  % SZS output start Proof for theBenchmark
% See solution above
% 5.90/1.78  % (3973443)------------------------------
% 5.90/1.78  % (3973443)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.90/1.78  % (3973443)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.90/1.78  % (3973443)CaDiCaL version: 2.1.3
% 5.90/1.78  % (3973443)Termination reason: Refutation
% 5.90/1.78  % (3973443)Time elapsed: 0.050 s
% 5.90/1.78  % (3973443)Peak memory usage: 90 MB
% 5.90/1.78  % (3973443)Instructions burned: 150 (million)
% 5.90/1.78  % (3973443)------------------------------
% 5.90/1.78  % (3973443)------------------------------
% 5.90/1.78  % (3973420)Success in time 0.76 s
% 5.90/1.78  % Vampire exiting
%------------------------------------------------------------------------------