TSTP Solution File: NUM434+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : NUM434+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Aug 31 17:59:31 EDT 2022
% Result : Theorem 0.21s 0.54s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 11
% Syntax : Number of formulae : 72 ( 13 unt; 0 def)
% Number of atoms : 267 ( 54 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 333 ( 138 ~; 135 |; 43 &)
% ( 7 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 96 ( 88 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f230,plain,
$false,
inference(subsumption_resolution,[],[f229,f90]) ).
fof(f90,plain,
aInteger0(xb),
inference(cnf_transformation,[],[f23]) ).
fof(f23,axiom,
( aInteger0(xb)
& aInteger0(xp)
& aInteger0(xa)
& sz00 != xp
& aInteger0(xq)
& sz00 != xq ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__979) ).
fof(f229,plain,
~ aInteger0(xb),
inference(resolution,[],[f228,f91]) ).
fof(f91,plain,
! [X0] :
( aInteger0(smndt0(X0))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f64]) ).
fof(f64,plain,
! [X0] :
( ~ aInteger0(X0)
| aInteger0(smndt0(X0)) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] :
( aInteger0(X0)
=> aInteger0(smndt0(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntNeg) ).
fof(f228,plain,
~ aInteger0(smndt0(xb)),
inference(subsumption_resolution,[],[f227,f89]) ).
fof(f89,plain,
aInteger0(xp),
inference(cnf_transformation,[],[f23]) ).
fof(f227,plain,
( ~ aInteger0(smndt0(xb))
| ~ aInteger0(xp) ),
inference(subsumption_resolution,[],[f226,f86]) ).
fof(f86,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f23]) ).
fof(f226,plain,
( ~ aInteger0(xq)
| ~ aInteger0(smndt0(xb))
| ~ aInteger0(xp) ),
inference(resolution,[],[f223,f99]) ).
fof(f99,plain,
! [X0,X1] :
( aInteger0(sdtasdt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f63]) ).
fof(f63,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| ~ aInteger0(X0)
| aInteger0(sdtasdt0(X0,X1)) ),
inference(flattening,[],[f62]) ).
fof(f62,plain,
! [X1,X0] :
( aInteger0(sdtasdt0(X0,X1))
| ~ aInteger0(X0)
| ~ aInteger0(X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X1,X0] :
( ( aInteger0(X0)
& aInteger0(X1) )
=> aInteger0(sdtasdt0(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntMult) ).
fof(f223,plain,
( ~ aInteger0(sdtasdt0(xp,xq))
| ~ aInteger0(smndt0(xb)) ),
inference(subsumption_resolution,[],[f222,f88]) ).
fof(f88,plain,
aInteger0(xa),
inference(cnf_transformation,[],[f23]) ).
fof(f222,plain,
( ~ aInteger0(sdtasdt0(xp,xq))
| ~ aInteger0(xa)
| ~ aInteger0(smndt0(xb)) ),
inference(resolution,[],[f217,f113]) ).
fof(f113,plain,
! [X0,X1] :
( aInteger0(sdtpldt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f75]) ).
fof(f75,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| aInteger0(sdtpldt0(X0,X1))
| ~ aInteger0(X0) ),
inference(rectify,[],[f41]) ).
fof(f41,plain,
! [X1,X0] :
( ~ aInteger0(X0)
| aInteger0(sdtpldt0(X1,X0))
| ~ aInteger0(X1) ),
inference(flattening,[],[f40]) ).
fof(f40,plain,
! [X1,X0] :
( aInteger0(sdtpldt0(X1,X0))
| ~ aInteger0(X0)
| ~ aInteger0(X1) ),
inference(ennf_transformation,[],[f29]) ).
fof(f29,plain,
! [X1,X0] :
( ( aInteger0(X0)
& aInteger0(X1) )
=> aInteger0(sdtpldt0(X1,X0)) ),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X1,X0] :
( ( aInteger0(X1)
& aInteger0(X0) )
=> aInteger0(sdtpldt0(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntPlus) ).
fof(f217,plain,
( ~ aInteger0(sdtpldt0(xa,smndt0(xb)))
| ~ aInteger0(sdtasdt0(xp,xq)) ),
inference(resolution,[],[f216,f193]) ).
fof(f193,plain,
( ~ aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
| ~ aInteger0(sdtpldt0(xa,smndt0(xb))) ),
inference(subsumption_resolution,[],[f192,f119]) ).
fof(f119,plain,
! [X0,X1] :
( ~ aDivisorOf0(X1,X0)
| ~ aInteger0(X0)
| aInteger0(sK0(X0,X1)) ),
inference(cnf_transformation,[],[f80]) ).
fof(f80,plain,
! [X0] :
( ! [X1] :
( ( ( sdtasdt0(X1,sK0(X0,X1)) = X0
& aInteger0(sK0(X0,X1))
& sz00 != X1
& aInteger0(X1) )
| ~ aDivisorOf0(X1,X0) )
& ( aDivisorOf0(X1,X0)
| ! [X3] :
( sdtasdt0(X1,X3) != X0
| ~ aInteger0(X3) )
| sz00 = X1
| ~ aInteger0(X1) ) )
| ~ aInteger0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f78,f79]) ).
fof(f79,plain,
! [X0,X1] :
( ? [X2] :
( sdtasdt0(X1,X2) = X0
& aInteger0(X2) )
=> ( sdtasdt0(X1,sK0(X0,X1)) = X0
& aInteger0(sK0(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f78,plain,
! [X0] :
( ! [X1] :
( ( ( ? [X2] :
( sdtasdt0(X1,X2) = X0
& aInteger0(X2) )
& sz00 != X1
& aInteger0(X1) )
| ~ aDivisorOf0(X1,X0) )
& ( aDivisorOf0(X1,X0)
| ! [X3] :
( sdtasdt0(X1,X3) != X0
| ~ aInteger0(X3) )
| sz00 = X1
| ~ aInteger0(X1) ) )
| ~ aInteger0(X0) ),
inference(rectify,[],[f77]) ).
fof(f77,plain,
! [X0] :
( ! [X1] :
( ( ( ? [X2] :
( sdtasdt0(X1,X2) = X0
& aInteger0(X2) )
& sz00 != X1
& aInteger0(X1) )
| ~ aDivisorOf0(X1,X0) )
& ( aDivisorOf0(X1,X0)
| ! [X2] :
( sdtasdt0(X1,X2) != X0
| ~ aInteger0(X2) )
| sz00 = X1
| ~ aInteger0(X1) ) )
| ~ aInteger0(X0) ),
inference(flattening,[],[f76]) ).
fof(f76,plain,
! [X0] :
( ! [X1] :
( ( ( ? [X2] :
( sdtasdt0(X1,X2) = X0
& aInteger0(X2) )
& sz00 != X1
& aInteger0(X1) )
| ~ aDivisorOf0(X1,X0) )
& ( aDivisorOf0(X1,X0)
| ! [X2] :
( sdtasdt0(X1,X2) != X0
| ~ aInteger0(X2) )
| sz00 = X1
| ~ aInteger0(X1) ) )
| ~ aInteger0(X0) ),
inference(nnf_transformation,[],[f56]) ).
fof(f56,plain,
! [X0] :
( ! [X1] :
( ( ? [X2] :
( sdtasdt0(X1,X2) = X0
& aInteger0(X2) )
& sz00 != X1
& aInteger0(X1) )
<=> aDivisorOf0(X1,X0) )
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,axiom,
! [X0] :
( aInteger0(X0)
=> ! [X1] :
( ( ? [X2] :
( sdtasdt0(X1,X2) = X0
& aInteger0(X2) )
& sz00 != X1
& aInteger0(X1) )
<=> aDivisorOf0(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDivisor) ).
fof(f192,plain,
( ~ aInteger0(sdtpldt0(xa,smndt0(xb)))
| ~ aInteger0(sK0(sdtpldt0(xa,smndt0(xb)),sdtasdt0(xp,xq)))
| ~ aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb))) ),
inference(resolution,[],[f130,f149]) ).
fof(f149,plain,
! [X0,X1] :
( sQ1_eqProxy(sdtasdt0(X1,sK0(X0,X1)),X0)
| ~ aDivisorOf0(X1,X0)
| ~ aInteger0(X0) ),
inference(equality_proxy_replacement,[],[f120,f125]) ).
fof(f125,plain,
! [X0,X1] :
( sQ1_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ1_eqProxy])]) ).
fof(f120,plain,
! [X0,X1] :
( sdtasdt0(X1,sK0(X0,X1)) = X0
| ~ aDivisorOf0(X1,X0)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f80]) ).
fof(f130,plain,
! [X0] :
( ~ sQ1_eqProxy(sdtasdt0(sdtasdt0(xp,xq),X0),sdtpldt0(xa,smndt0(xb)))
| ~ aInteger0(X0) ),
inference(equality_proxy_replacement,[],[f93,f125]) ).
fof(f93,plain,
! [X0] :
( sdtasdt0(sdtasdt0(xp,xq),X0) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f47]) ).
fof(f47,plain,
! [X0] :
( sdtasdt0(sdtasdt0(xp,xq),X0) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,negated_conjecture,
~ ? [X0] :
( sdtasdt0(sdtasdt0(xp,xq),X0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X0) ),
inference(negated_conjecture,[],[f25]) ).
fof(f25,conjecture,
? [X0] :
( sdtasdt0(sdtasdt0(xp,xq),X0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f216,plain,
( aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
| ~ aInteger0(sdtasdt0(xp,xq)) ),
inference(subsumption_resolution,[],[f215,f86]) ).
fof(f215,plain,
( ~ aInteger0(sdtasdt0(xp,xq))
| aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
| ~ aInteger0(xq) ),
inference(subsumption_resolution,[],[f214,f128]) ).
fof(f128,plain,
~ sQ1_eqProxy(sz00,xq),
inference(equality_proxy_replacement,[],[f85,f125]) ).
fof(f85,plain,
sz00 != xq,
inference(cnf_transformation,[],[f23]) ).
fof(f214,plain,
( ~ aInteger0(sdtasdt0(xp,xq))
| sQ1_eqProxy(sz00,xq)
| ~ aInteger0(xq)
| aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb))) ),
inference(subsumption_resolution,[],[f213,f127]) ).
fof(f127,plain,
~ sQ1_eqProxy(sz00,xp),
inference(equality_proxy_replacement,[],[f87,f125]) ).
fof(f87,plain,
sz00 != xp,
inference(cnf_transformation,[],[f23]) ).
fof(f213,plain,
( sQ1_eqProxy(sz00,xp)
| ~ aInteger0(xq)
| sQ1_eqProxy(sz00,xq)
| ~ aInteger0(sdtasdt0(xp,xq))
| aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb))) ),
inference(subsumption_resolution,[],[f211,f89]) ).
fof(f211,plain,
( aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
| ~ aInteger0(xp)
| ~ aInteger0(xq)
| sQ1_eqProxy(sz00,xq)
| ~ aInteger0(sdtasdt0(xp,xq))
| sQ1_eqProxy(sz00,xp) ),
inference(resolution,[],[f163,f142]) ).
fof(f142,plain,
! [X0,X1] :
( ~ sQ1_eqProxy(sz00,sdtasdt0(X1,X0))
| sQ1_eqProxy(sz00,X0)
| ~ aInteger0(X0)
| sQ1_eqProxy(sz00,X1)
| ~ aInteger0(X1) ),
inference(equality_proxy_replacement,[],[f107,f125,f125,f125]) ).
fof(f107,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| sz00 != sdtasdt0(X1,X0)
| sz00 = X0
| sz00 = X1
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f72]) ).
fof(f72,plain,
! [X0,X1] :
( ~ aInteger0(X1)
| sz00 != sdtasdt0(X1,X0)
| sz00 = X0
| sz00 = X1
| ~ aInteger0(X0) ),
inference(rectify,[],[f68]) ).
fof(f68,plain,
! [X1,X0] :
( ~ aInteger0(X0)
| sz00 != sdtasdt0(X0,X1)
| sz00 = X1
| sz00 = X0
| ~ aInteger0(X1) ),
inference(flattening,[],[f67]) ).
fof(f67,plain,
! [X1,X0] :
( sz00 = X1
| sz00 = X0
| sz00 != sdtasdt0(X0,X1)
| ~ aInteger0(X0)
| ~ aInteger0(X1) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,axiom,
! [X1,X0] :
( ( aInteger0(X0)
& aInteger0(X1) )
=> ( sz00 = sdtasdt0(X0,X1)
=> ( sz00 = X1
| sz00 = X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mZeroDiv) ).
fof(f163,plain,
( sQ1_eqProxy(sz00,sdtasdt0(xp,xq))
| ~ aInteger0(sdtasdt0(xp,xq))
| aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb))) ),
inference(subsumption_resolution,[],[f162,f90]) ).
fof(f162,plain,
( aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
| ~ aInteger0(sdtasdt0(xp,xq))
| ~ aInteger0(xb)
| sQ1_eqProxy(sz00,sdtasdt0(xp,xq)) ),
inference(subsumption_resolution,[],[f160,f88]) ).
fof(f160,plain,
( ~ aInteger0(sdtasdt0(xp,xq))
| aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
| ~ aInteger0(xa)
| sQ1_eqProxy(sz00,sdtasdt0(xp,xq))
| ~ aInteger0(xb) ),
inference(resolution,[],[f100,f151]) ).
fof(f151,plain,
! [X2,X0,X1] :
( ~ sdteqdtlpzmzozddtrp0(X0,X1,X2)
| ~ aInteger0(X2)
| sQ1_eqProxy(sz00,X2)
| ~ aInteger0(X0)
| aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1)))
| ~ aInteger0(X1) ),
inference(equality_proxy_replacement,[],[f122,f125]) ).
fof(f122,plain,
! [X2,X0,X1] :
( aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1)))
| ~ sdteqdtlpzmzozddtrp0(X0,X1,X2)
| ~ aInteger0(X2)
| sz00 = X2
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f82]) ).
fof(f82,plain,
! [X0,X1,X2] :
( ( ( aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1)))
| ~ sdteqdtlpzmzozddtrp0(X0,X1,X2) )
& ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
| ~ aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) ) )
| ~ aInteger0(X2)
| sz00 = X2
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(rectify,[],[f81]) ).
fof(f81,plain,
! [X0,X2,X1] :
( ( ( aDivisorOf0(X1,sdtpldt0(X0,smndt0(X2)))
| ~ sdteqdtlpzmzozddtrp0(X0,X2,X1) )
& ( sdteqdtlpzmzozddtrp0(X0,X2,X1)
| ~ aDivisorOf0(X1,sdtpldt0(X0,smndt0(X2))) ) )
| ~ aInteger0(X1)
| sz00 = X1
| ~ aInteger0(X2)
| ~ aInteger0(X0) ),
inference(nnf_transformation,[],[f43]) ).
fof(f43,plain,
! [X0,X2,X1] :
( ( aDivisorOf0(X1,sdtpldt0(X0,smndt0(X2)))
<=> sdteqdtlpzmzozddtrp0(X0,X2,X1) )
| ~ aInteger0(X1)
| sz00 = X1
| ~ aInteger0(X2)
| ~ aInteger0(X0) ),
inference(flattening,[],[f42]) ).
fof(f42,plain,
! [X2,X1,X0] :
( ( aDivisorOf0(X1,sdtpldt0(X0,smndt0(X2)))
<=> sdteqdtlpzmzozddtrp0(X0,X2,X1) )
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| sz00 = X1
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,plain,
! [X2,X1,X0] :
( ( aInteger0(X2)
& aInteger0(X1)
& sz00 != X1
& aInteger0(X0) )
=> ( aDivisorOf0(X1,sdtpldt0(X0,smndt0(X2)))
<=> sdteqdtlpzmzozddtrp0(X0,X2,X1) ) ),
inference(rectify,[],[f19]) ).
fof(f19,axiom,
! [X0,X2,X1] :
( ( aInteger0(X2)
& aInteger0(X1)
& sz00 != X2
& aInteger0(X0) )
=> ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
<=> aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEquMod) ).
fof(f100,plain,
sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)),
inference(cnf_transformation,[],[f24]) ).
fof(f24,axiom,
sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1003) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM434+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 06:46:21 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.52 % (21475)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.21/0.52 % (21475)First to succeed.
% 0.21/0.53 % (21465)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.53 % (21472)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.21/0.53 % (21487)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.21/0.53 % (21464)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.21/0.53 % (21477)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.53 % (21473)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.21/0.54 % (21480)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.54 % (21492)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.21/0.54 % (21474)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.54 % (21463)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.21/0.54 % (21467)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.21/0.54 % (21477)Instruction limit reached!
% 0.21/0.54 % (21477)------------------------------
% 0.21/0.54 % (21477)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.54 % (21477)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.54 % (21477)Termination reason: Unknown
% 0.21/0.54 % (21477)Termination phase: Saturation
% 0.21/0.54
% 0.21/0.54 % (21477)Memory used [KB]: 6012
% 0.21/0.54 % (21477)Time elapsed: 0.005 s
% 0.21/0.54 % (21477)Instructions burned: 3 (million)
% 0.21/0.54 % (21477)------------------------------
% 0.21/0.54 % (21477)------------------------------
% 0.21/0.54 % (21468)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.21/0.54 % (21475)Refutation found. Thanks to Tanya!
% 0.21/0.54 % SZS status Theorem for theBenchmark
% 0.21/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.54 % (21475)------------------------------
% 0.21/0.54 % (21475)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.54 % (21475)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.54 % (21475)Termination reason: Refutation
% 0.21/0.54
% 0.21/0.54 % (21475)Memory used [KB]: 1535
% 0.21/0.54 % (21475)Time elapsed: 0.109 s
% 0.21/0.54 % (21475)Instructions burned: 4 (million)
% 0.21/0.54 % (21475)------------------------------
% 0.21/0.54 % (21475)------------------------------
% 0.21/0.54 % (21462)Success in time 0.184 s
%------------------------------------------------------------------------------