TSTP Solution File: SWC048+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC048+1 : TPTP v8.1.0. Released v2.4.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 : n011.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 18:38:25 EDT 2022
% Result : Theorem 0.20s 0.55s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 10
% Syntax : Number of formulae : 55 ( 11 unt; 0 def)
% Number of atoms : 328 ( 112 equ)
% Maximal formula atoms : 34 ( 5 avg)
% Number of connectives : 403 ( 130 ~; 131 |; 121 &)
% ( 2 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 70 ( 44 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f391,plain,
$false,
inference(unit_resulting_resolution,[],[f177,f388,f215]) ).
fof(f215,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f208]) ).
fof(f208,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f179]) ).
fof(f179,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f139]) ).
fof(f139,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f103]) ).
fof(f103,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f388,plain,
neq(nil,nil),
inference(trivial_inequality_removal,[],[f386]) ).
fof(f386,plain,
( neq(nil,nil)
| nil != nil ),
inference(backward_demodulation,[],[f311,f375]) ).
fof(f375,plain,
nil = sK0,
inference(subsumption_resolution,[],[f374,f177]) ).
fof(f374,plain,
( ~ ssList(nil)
| nil = sK0 ),
inference(subsumption_resolution,[],[f373,f224]) ).
fof(f224,plain,
rearsegP(sK0,nil),
inference(resolution,[],[f158,f198]) ).
fof(f198,plain,
! [X0] :
( ~ ssList(X0)
| rearsegP(X0,nil) ),
inference(cnf_transformation,[],[f98]) ).
fof(f98,plain,
! [X0] :
( ~ ssList(X0)
| rearsegP(X0,nil) ),
inference(ennf_transformation,[],[f51]) ).
fof(f51,axiom,
! [X0] :
( ssList(X0)
=> rearsegP(X0,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax51) ).
fof(f158,plain,
ssList(sK0),
inference(cnf_transformation,[],[f134]) ).
fof(f134,plain,
( ssList(sK3)
& sK3 = sK1
& ( ( nil = sK1
& nil != sK0 )
| ( neq(sK1,nil)
& ! [X4] :
( ~ rearsegP(sK1,X4)
| ~ rearsegP(sK0,X4)
| ~ ssList(X4)
| ~ neq(X4,nil) ) ) )
& ( ( nil = sK3
& nil = sK2 )
| ( neq(sK2,nil)
& rearsegP(sK3,sK2) ) )
& sK2 = sK0
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f112,f133,f132,f131,f130]) ).
fof(f130,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X4] :
( ~ rearsegP(X1,X4)
| ~ rearsegP(X0,X4)
| ~ ssList(X4)
| ~ neq(X4,nil) ) ) )
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& X0 = X2 )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& ( ( nil = X1
& nil != sK0 )
| ( neq(X1,nil)
& ! [X4] :
( ~ rearsegP(X1,X4)
| ~ rearsegP(sK0,X4)
| ~ ssList(X4)
| ~ neq(X4,nil) ) ) )
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& sK0 = X2 )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& ( ( nil = X1
& nil != sK0 )
| ( neq(X1,nil)
& ! [X4] :
( ~ rearsegP(X1,X4)
| ~ rearsegP(sK0,X4)
| ~ ssList(X4)
| ~ neq(X4,nil) ) ) )
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& sK0 = X2 )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ssList(X3)
& sK1 = X3
& ( ( nil = sK1
& nil != sK0 )
| ( neq(sK1,nil)
& ! [X4] :
( ~ rearsegP(sK1,X4)
| ~ rearsegP(sK0,X4)
| ~ ssList(X4)
| ~ neq(X4,nil) ) ) )
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& sK0 = X2 )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
( ? [X2] :
( ? [X3] :
( ssList(X3)
& sK1 = X3
& ( ( nil = sK1
& nil != sK0 )
| ( neq(sK1,nil)
& ! [X4] :
( ~ rearsegP(sK1,X4)
| ~ rearsegP(sK0,X4)
| ~ ssList(X4)
| ~ neq(X4,nil) ) ) )
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& sK0 = X2 )
& ssList(X2) )
=> ( ? [X3] :
( ssList(X3)
& sK1 = X3
& ( ( nil = sK1
& nil != sK0 )
| ( neq(sK1,nil)
& ! [X4] :
( ~ rearsegP(sK1,X4)
| ~ rearsegP(sK0,X4)
| ~ ssList(X4)
| ~ neq(X4,nil) ) ) )
& ( ( nil = X3
& nil = sK2 )
| ( neq(sK2,nil)
& rearsegP(X3,sK2) ) )
& sK2 = sK0 )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
( ? [X3] :
( ssList(X3)
& sK1 = X3
& ( ( nil = sK1
& nil != sK0 )
| ( neq(sK1,nil)
& ! [X4] :
( ~ rearsegP(sK1,X4)
| ~ rearsegP(sK0,X4)
| ~ ssList(X4)
| ~ neq(X4,nil) ) ) )
& ( ( nil = X3
& nil = sK2 )
| ( neq(sK2,nil)
& rearsegP(X3,sK2) ) )
& sK2 = sK0 )
=> ( ssList(sK3)
& sK3 = sK1
& ( ( nil = sK1
& nil != sK0 )
| ( neq(sK1,nil)
& ! [X4] :
( ~ rearsegP(sK1,X4)
| ~ rearsegP(sK0,X4)
| ~ ssList(X4)
| ~ neq(X4,nil) ) ) )
& ( ( nil = sK3
& nil = sK2 )
| ( neq(sK2,nil)
& rearsegP(sK3,sK2) ) )
& sK2 = sK0 ) ),
introduced(choice_axiom,[]) ).
fof(f112,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X4] :
( ~ rearsegP(X1,X4)
| ~ rearsegP(X0,X4)
| ~ ssList(X4)
| ~ neq(X4,nil) ) ) )
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& X0 = X2 )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f111]) ).
fof(f111,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X4] :
( ~ rearsegP(X1,X4)
| ~ rearsegP(X0,X4)
| ~ ssList(X4)
| ~ neq(X4,nil) ) ) )
& X0 = X2
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil = X0
| nil != X1 )
& ( ~ neq(X1,nil)
| ? [X4] :
( rearsegP(X0,X4)
& neq(X4,nil)
& rearsegP(X1,X4)
& ssList(X4) ) ) )
| X0 != X2
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ rearsegP(X3,X2) ) )
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil = X0
| nil != X1 )
& ( ~ neq(X1,nil)
| ? [X4] :
( rearsegP(X0,X4)
& neq(X4,nil)
& rearsegP(X1,X4)
& ssList(X4) ) ) )
| X0 != X2
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ rearsegP(X3,X2) ) )
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f373,plain,
( ~ rearsegP(sK0,nil)
| ~ ssList(nil)
| nil = sK0 ),
inference(subsumption_resolution,[],[f367,f158]) ).
fof(f367,plain,
( ~ ssList(sK0)
| ~ rearsegP(sK0,nil)
| ~ ssList(nil)
| nil = sK0 ),
inference(duplicate_literal_removal,[],[f365]) ).
fof(f365,plain,
( ~ ssList(nil)
| nil = sK0
| nil = sK0
| ~ ssList(sK0)
| ~ rearsegP(sK0,nil) ),
inference(resolution,[],[f313,f199]) ).
fof(f199,plain,
! [X0,X1] :
( ~ rearsegP(X1,X0)
| ~ rearsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f129]) ).
fof(f129,plain,
! [X0] :
( ! [X1] :
( X0 = X1
| ~ rearsegP(X0,X1)
| ~ ssList(X1)
| ~ rearsegP(X1,X0) )
| ~ ssList(X0) ),
inference(flattening,[],[f128]) ).
fof(f128,plain,
! [X0] :
( ! [X1] :
( X0 = X1
| ~ rearsegP(X0,X1)
| ~ rearsegP(X1,X0)
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f48]) ).
fof(f48,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( ( rearsegP(X0,X1)
& rearsegP(X1,X0) )
=> X0 = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax48) ).
fof(f313,plain,
( rearsegP(nil,sK0)
| nil = sK0 ),
inference(backward_demodulation,[],[f205,f292]) ).
fof(f292,plain,
nil = sK1,
inference(subsumption_resolution,[],[f291,f202]) ).
fof(f202,plain,
( neq(sK0,nil)
| nil = sK1 ),
inference(definition_unfolding,[],[f165,f170,f161]) ).
fof(f161,plain,
sK2 = sK0,
inference(cnf_transformation,[],[f134]) ).
fof(f170,plain,
sK3 = sK1,
inference(cnf_transformation,[],[f134]) ).
fof(f165,plain,
( nil = sK3
| neq(sK2,nil) ),
inference(cnf_transformation,[],[f134]) ).
fof(f291,plain,
( nil = sK1
| ~ neq(sK0,nil) ),
inference(subsumption_resolution,[],[f290,f225]) ).
fof(f225,plain,
rearsegP(sK0,sK0),
inference(resolution,[],[f158,f200]) ).
fof(f200,plain,
! [X0] :
( ~ ssList(X0)
| rearsegP(X0,X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
! [X0] :
( ~ ssList(X0)
| rearsegP(X0,X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f49,axiom,
! [X0] :
( ssList(X0)
=> rearsegP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax49) ).
fof(f290,plain,
( ~ rearsegP(sK0,sK0)
| ~ neq(sK0,nil)
| nil = sK1 ),
inference(subsumption_resolution,[],[f289,f158]) ).
fof(f289,plain,
( nil = sK1
| ~ neq(sK0,nil)
| ~ ssList(sK0)
| ~ rearsegP(sK0,sK0) ),
inference(duplicate_literal_removal,[],[f287]) ).
fof(f287,plain,
( nil = sK1
| ~ ssList(sK0)
| ~ neq(sK0,nil)
| nil = sK1
| ~ rearsegP(sK0,sK0) ),
inference(resolution,[],[f168,f203]) ).
fof(f203,plain,
( rearsegP(sK1,sK0)
| nil = sK1 ),
inference(definition_unfolding,[],[f164,f170,f170,f161]) ).
fof(f164,plain,
( nil = sK3
| rearsegP(sK3,sK2) ),
inference(cnf_transformation,[],[f134]) ).
fof(f168,plain,
! [X4] :
( ~ rearsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK0,X4)
| nil = sK1
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f134]) ).
fof(f205,plain,
( rearsegP(sK1,sK0)
| nil = sK0 ),
inference(definition_unfolding,[],[f162,f161,f170,f161]) ).
fof(f162,plain,
( nil = sK2
| rearsegP(sK3,sK2) ),
inference(cnf_transformation,[],[f134]) ).
fof(f311,plain,
( nil != sK0
| neq(nil,nil) ),
inference(backward_demodulation,[],[f167,f292]) ).
fof(f167,plain,
( nil != sK0
| neq(sK1,nil) ),
inference(cnf_transformation,[],[f134]) ).
fof(f177,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC048+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/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 : n011.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 17:59:25 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.51 % (13204)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.20/0.52 % (13195)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (13193)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.20/0.53 % (13216)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.20/0.53 % (13192)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.20/0.53 % (13204)Instruction limit reached!
% 0.20/0.53 % (13204)------------------------------
% 0.20/0.53 % (13204)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (13204)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (13204)Termination reason: Unknown
% 0.20/0.53 % (13204)Termination phase: Saturation
% 0.20/0.53
% 0.20/0.53 % (13204)Memory used [KB]: 6140
% 0.20/0.53 % (13204)Time elapsed: 0.117 s
% 0.20/0.53 % (13204)Instructions burned: 7 (million)
% 0.20/0.53 % (13204)------------------------------
% 0.20/0.53 % (13204)------------------------------
% 0.20/0.53 % (13208)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.53 % (13202)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.20/0.54 % (13216)First to succeed.
% 0.20/0.54 % (13203)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.20/0.54 % (13209)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.54 % (13215)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.20/0.54 % (13212)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.20/0.54 % (13205)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.20/0.54 % (13198)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.54 % (13220)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.20/0.54 % (13194)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.20/0.54 % (13210)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.55 % (13208)Instruction limit reached!
% 0.20/0.55 % (13208)------------------------------
% 0.20/0.55 % (13208)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (13208)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (13208)Termination reason: Unknown
% 0.20/0.55 % (13208)Termination phase: Property scanning
% 0.20/0.55
% 0.20/0.55 % (13208)Memory used [KB]: 1791
% 0.20/0.55 % (13208)Time elapsed: 0.006 s
% 0.20/0.55 % (13208)Instructions burned: 7 (million)
% 0.20/0.55 % (13208)------------------------------
% 0.20/0.55 % (13208)------------------------------
% 0.20/0.55 % (13217)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.20/0.55 % (13216)Refutation found. Thanks to Tanya!
% 0.20/0.55 % SZS status Theorem for theBenchmark
% 0.20/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.55 % (13216)------------------------------
% 0.20/0.55 % (13216)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (13216)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (13216)Termination reason: Refutation
% 0.20/0.55
% 0.20/0.55 % (13216)Memory used [KB]: 1663
% 0.20/0.55 % (13216)Time elapsed: 0.082 s
% 0.20/0.55 % (13216)Instructions burned: 12 (million)
% 0.20/0.55 % (13216)------------------------------
% 0.20/0.55 % (13216)------------------------------
% 0.20/0.55 % (13188)Success in time 0.193 s
%------------------------------------------------------------------------------