TSTP Solution File: SWC012+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC012+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_sat --cores 0 -t %d %s
% Computer : n014.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:41:11 EDT 2022
% Result : Theorem 0.22s 0.56s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 10
% Syntax : Number of formulae : 48 ( 18 unt; 0 def)
% Number of atoms : 292 ( 105 equ)
% Maximal formula atoms : 32 ( 6 avg)
% Number of connectives : 374 ( 130 ~; 108 |; 115 &)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 110 ( 66 !; 44 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f661,plain,
$false,
inference(subsumption_resolution,[],[f660,f466]) ).
fof(f466,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f660,plain,
~ ssList(nil),
inference(subsumption_resolution,[],[f659,f655]) ).
fof(f655,plain,
sK42 = app(sK42,nil),
inference(resolution,[],[f490,f504]) ).
fof(f504,plain,
ssList(sK42),
inference(cnf_transformation,[],[f321]) ).
fof(f321,plain,
( ssList(sK42)
& sK42 = sK44
& sK45 = sK43
& ( ( ssItem(sK46)
& sK45 = app(sK44,cons(sK46,nil))
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != sK42
| ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != sK43 )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(sK43,nil) )
| ( neq(sK43,nil)
& ~ neq(sK45,nil) ) )
& ssList(sK45)
& ssList(sK44)
& ssList(sK43) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK42,sK43,sK44,sK45,sK46])],[f194,f320,f319,f318,f317,f316]) ).
fof(f316,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& X1 = X3
& ( ( ? [X4] :
( ssItem(X4)
& app(X2,cons(X4,nil)) = X3 )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != X0
| ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != X1 )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(X1,nil) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) ) )
=> ( ssList(sK42)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( sK42 = X2
& X1 = X3
& ( ( ? [X4] :
( ssItem(X4)
& app(X2,cons(X4,nil)) = X3 )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != sK42
| ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != X1 )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(X1,nil) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f317,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( sK42 = X2
& X1 = X3
& ( ( ? [X4] :
( ssItem(X4)
& app(X2,cons(X4,nil)) = X3 )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != sK42
| ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != X1 )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(X1,nil) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( sK42 = X2
& sK43 = X3
& ( ( ? [X4] :
( ssItem(X4)
& app(X2,cons(X4,nil)) = X3 )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != sK42
| ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != sK43 )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(sK43,nil) )
| ( neq(sK43,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(sK43) ) ),
introduced(choice_axiom,[]) ).
fof(f318,plain,
( ? [X2] :
( ? [X3] :
( sK42 = X2
& sK43 = X3
& ( ( ? [X4] :
( ssItem(X4)
& app(X2,cons(X4,nil)) = X3 )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != sK42
| ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != sK43 )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(sK43,nil) )
| ( neq(sK43,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( sK42 = sK44
& sK43 = X3
& ( ( ? [X4] :
( ssItem(X4)
& app(sK44,cons(X4,nil)) = X3 )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != sK42
| ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != sK43 )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(sK43,nil) )
| ( neq(sK43,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(sK44) ) ),
introduced(choice_axiom,[]) ).
fof(f319,plain,
( ? [X3] :
( sK42 = sK44
& sK43 = X3
& ( ( ? [X4] :
( ssItem(X4)
& app(sK44,cons(X4,nil)) = X3 )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != sK42
| ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != sK43 )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(sK43,nil) )
| ( neq(sK43,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
=> ( sK42 = sK44
& sK45 = sK43
& ( ( ? [X4] :
( ssItem(X4)
& sK45 = app(sK44,cons(X4,nil)) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != sK42
| ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != sK43 )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(sK43,nil) )
| ( neq(sK43,nil)
& ~ neq(sK45,nil) ) )
& ssList(sK45) ) ),
introduced(choice_axiom,[]) ).
fof(f320,plain,
( ? [X4] :
( ssItem(X4)
& sK45 = app(sK44,cons(X4,nil)) )
=> ( ssItem(sK46)
& sK45 = app(sK44,cons(sK46,nil)) ) ),
introduced(choice_axiom,[]) ).
fof(f194,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& X1 = X3
& ( ( ? [X4] :
( ssItem(X4)
& app(X2,cons(X4,nil)) = X3 )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != X0
| ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != X1 )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(X1,nil) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) ) ),
inference(flattening,[],[f193]) ).
fof(f193,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ? [X4] :
( ssItem(X4)
& app(X2,cons(X4,nil)) = X3 )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != X0
| ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != X1 )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(X1,nil) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& X1 = X3
& X0 = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(app(X6,cons(X5,nil)),X7) = X1
& ssList(X7)
& app(X6,X7) = X0 )
& ssList(X6) )
& ssItem(X5) )
| ! [X4] :
( ssItem(X4)
=> app(X2,cons(X4,nil)) != X3 )
| ~ neq(X1,nil) )
& ( neq(X3,nil)
| ~ neq(X1,nil) ) )
| X1 != X3
| X0 != X2 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ! [X7] :
( ssItem(X7)
=> app(X2,cons(X7,nil)) != X3 )
| ~ neq(X1,nil)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = X1
& ssList(X6)
& app(X5,X6) = X0 ) ) ) )
& ( neq(X3,nil)
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ! [X7] :
( ssItem(X7)
=> app(X2,cons(X7,nil)) != X3 )
| ~ neq(X1,nil)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = X1
& ssList(X6)
& app(X5,X6) = X0 ) ) ) )
& ( neq(X3,nil)
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f490,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f106]) ).
fof(f106,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax84) ).
fof(f659,plain,
( sK42 != app(sK42,nil)
| ~ ssList(nil) ),
inference(trivial_inequality_removal,[],[f658]) ).
fof(f658,plain,
( sK42 != app(sK42,nil)
| sK43 != sK43
| ~ ssList(nil) ),
inference(superposition,[],[f618,f656]) ).
fof(f656,plain,
sK43 = app(sK43,nil),
inference(resolution,[],[f490,f602]) ).
fof(f602,plain,
ssList(sK43),
inference(backward_demodulation,[],[f493,f502]) ).
fof(f502,plain,
sK45 = sK43,
inference(cnf_transformation,[],[f321]) ).
fof(f493,plain,
ssList(sK45),
inference(cnf_transformation,[],[f321]) ).
fof(f618,plain,
! [X0] :
( sK43 != app(sK43,X0)
| app(sK42,X0) != sK42
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f617,f504]) ).
fof(f617,plain,
! [X0] :
( app(sK42,X0) != sK42
| ~ ssList(sK42)
| sK43 != app(sK43,X0)
| ~ ssList(X0) ),
inference(superposition,[],[f616,f611]) ).
fof(f611,plain,
sK43 = app(sK42,sF58),
inference(backward_demodulation,[],[f610,f503]) ).
fof(f503,plain,
sK42 = sK44,
inference(cnf_transformation,[],[f321]) ).
fof(f610,plain,
sK43 = app(sK44,sF58),
inference(backward_demodulation,[],[f591,f609]) ).
fof(f609,plain,
sK43 = sF59,
inference(subsumption_resolution,[],[f608,f599]) ).
fof(f599,plain,
neq(sK43,nil),
inference(duplicate_literal_removal,[],[f495]) ).
fof(f495,plain,
( neq(sK43,nil)
| neq(sK43,nil) ),
inference(cnf_transformation,[],[f321]) ).
fof(f608,plain,
( ~ neq(sK43,nil)
| sK43 = sF59 ),
inference(forward_demodulation,[],[f607,f502]) ).
fof(f607,plain,
( sK43 = sF59
| ~ neq(sK45,nil) ),
inference(forward_demodulation,[],[f593,f502]) ).
fof(f593,plain,
( sK45 = sF59
| ~ neq(sK45,nil) ),
inference(definition_folding,[],[f498,f591,f590]) ).
fof(f590,plain,
sF58 = cons(sK46,nil),
introduced(function_definition,[]) ).
fof(f498,plain,
( sK45 = app(sK44,cons(sK46,nil))
| ~ neq(sK45,nil) ),
inference(cnf_transformation,[],[f321]) ).
fof(f591,plain,
sF59 = app(sK44,sF58),
introduced(function_definition,[]) ).
fof(f616,plain,
! [X0,X1] :
( sK43 != app(app(X0,sF58),X1)
| ~ ssList(X1)
| app(X0,X1) != sK42
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f615,f604]) ).
fof(f604,plain,
ssItem(sK46),
inference(subsumption_resolution,[],[f603,f599]) ).
fof(f603,plain,
( ssItem(sK46)
| ~ neq(sK43,nil) ),
inference(backward_demodulation,[],[f500,f502]) ).
fof(f500,plain,
( ~ neq(sK45,nil)
| ssItem(sK46) ),
inference(cnf_transformation,[],[f321]) ).
fof(f615,plain,
! [X0,X1] :
( ~ ssItem(sK46)
| sK43 != app(app(X0,sF58),X1)
| ~ ssList(X1)
| ~ ssList(X0)
| app(X0,X1) != sK42 ),
inference(superposition,[],[f606,f590]) ).
fof(f606,plain,
! [X6,X7,X5] :
( app(app(X6,cons(X5,nil)),X7) != sK43
| ~ ssList(X6)
| ~ ssList(X7)
| ~ ssItem(X5)
| app(X6,X7) != sK42 ),
inference(subsumption_resolution,[],[f605,f599]) ).
fof(f605,plain,
! [X6,X7,X5] :
( ~ neq(sK43,nil)
| app(app(X6,cons(X5,nil)),X7) != sK43
| ~ ssItem(X5)
| app(X6,X7) != sK42
| ~ ssList(X6)
| ~ ssList(X7) ),
inference(forward_demodulation,[],[f496,f502]) ).
fof(f496,plain,
! [X6,X7,X5] :
( ~ ssItem(X5)
| ~ neq(sK45,nil)
| app(X6,X7) != sK42
| ~ ssList(X6)
| app(app(X6,cons(X5,nil)),X7) != sK43
| ~ ssList(X7) ),
inference(cnf_transformation,[],[f321]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SWC012+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.36 % Computer : n014.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Aug 30 17:57:03 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.22/0.53 % (19264)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.22/0.53 % (19237)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.22/0.54 % (19246)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.22/0.54 % (19245)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.22/0.54 % (19247)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.22/0.54 % (19241)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.22/0.54 % (19239)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.22/0.55 % (19242)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.22/0.55 % (19260)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.22/0.55 % (19261)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.22/0.55 % (19252)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.22/0.55 % (19240)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.22/0.55 % (19256)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.22/0.55 % (19267)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.22/0.55 % (19248)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.22/0.55 % (19236)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.22/0.56 % (19250)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.22/0.56 % (19238)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.22/0.56 % (19253)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.22/0.56 % (19243)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.22/0.56 % (19244)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.22/0.56 % (19237)Refutation not found, incomplete strategy% (19237)------------------------------
% 0.22/0.56 % (19237)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.22/0.56 % (19264)First to succeed.
% 0.22/0.56 % (19244)Instruction limit reached!
% 0.22/0.56 % (19244)------------------------------
% 0.22/0.56 % (19244)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.22/0.56 % (19244)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.22/0.56 % (19244)Termination reason: Unknown
% 0.22/0.56 % (19244)Termination phase: shuffling
% 0.22/0.56
% 0.22/0.56 % (19244)Memory used [KB]: 1023
% 0.22/0.56 % (19244)Time elapsed: 0.002 s
% 0.22/0.56 % (19244)Instructions burned: 3 (million)
% 0.22/0.56 % (19244)------------------------------
% 0.22/0.56 % (19244)------------------------------
% 0.22/0.56 % (19262)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.22/0.56 % (19251)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.22/0.56 % (19245)Also succeeded, but the first one will report.
% 0.22/0.56 % (19264)Refutation found. Thanks to Tanya!
% 0.22/0.56 % SZS status Theorem for theBenchmark
% 0.22/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.56 % (19264)------------------------------
% 0.22/0.56 % (19264)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.22/0.56 % (19264)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.22/0.56 % (19264)Termination reason: Refutation
% 0.22/0.56
% 0.22/0.56 % (19264)Memory used [KB]: 1535
% 0.22/0.56 % (19264)Time elapsed: 0.124 s
% 0.22/0.56 % (19264)Instructions burned: 18 (million)
% 0.22/0.56 % (19264)------------------------------
% 0.22/0.56 % (19264)------------------------------
% 0.22/0.56 % (19232)Success in time 0.193 s
%------------------------------------------------------------------------------