TSTP Solution File: SWC032+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC032+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 : n022.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:18 EDT 2022
% Result : Theorem 1.42s 0.56s
% Output : Refutation 1.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 52 ( 9 unt; 0 def)
% Number of atoms : 400 ( 203 equ)
% Maximal formula atoms : 44 ( 7 avg)
% Number of connectives : 536 ( 188 ~; 166 |; 159 &)
% ( 5 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 4 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 118 ( 75 !; 43 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f720,plain,
$false,
inference(avatar_sat_refutation,[],[f615,f616,f618,f695,f717]) ).
fof(f717,plain,
( spl58_1
| ~ spl58_2
| ~ spl58_4 ),
inference(avatar_contradiction_clause,[],[f716]) ).
fof(f716,plain,
( $false
| spl58_1
| ~ spl58_2
| ~ spl58_4 ),
inference(subsumption_resolution,[],[f715,f610]) ).
fof(f610,plain,
( nil != sK37
| spl58_1 ),
inference(avatar_component_clause,[],[f608]) ).
fof(f608,plain,
( spl58_1
<=> nil = sK37 ),
introduced(avatar_definition,[new_symbols(naming,[spl58_1])]) ).
fof(f715,plain,
( nil = sK37
| ~ spl58_2
| ~ spl58_4 ),
inference(forward_demodulation,[],[f698,f627]) ).
fof(f627,plain,
app(sK37,nil) = sK37,
inference(resolution,[],[f420,f570]) ).
fof(f570,plain,
ssList(sK37),
inference(definition_unfolding,[],[f497,f498]) ).
fof(f498,plain,
sK39 = sK37,
inference(cnf_transformation,[],[f317]) ).
fof(f317,plain,
( ssList(sK37)
& ssList(sK40)
& ssList(sK41)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != sK41
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK39 )
| ~ ssItem(X7) ) ) )
& sK40 = app(sK39,sK41)
& strictorderedP(sK39)
& ( nil = sK40
| nil != sK39 )
& ( ( nil != sK37
& nil = sK38 )
| ( nil != sK38
& nil = sK37 ) )
& sK38 = sK40
& sK39 = sK37
& ssList(sK39)
& ssList(sK38) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK37,sK38,sK39,sK40,sK41])],[f220,f316,f315,f314,f313,f312]) ).
fof(f312,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) ) )
& app(X2,X4) = X3
& strictorderedP(X2) )
& ( nil = X3
| nil != X2 )
& ( ( nil != X0
& nil = X1 )
| ( nil != X1
& nil = X0 ) )
& X1 = X3
& X0 = X2 )
& ssList(X2) )
& ssList(X1) ) )
=> ( ssList(sK37)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) ) )
& app(X2,X4) = X3
& strictorderedP(X2) )
& ( nil = X3
| nil != X2 )
& ( ( nil != sK37
& nil = X1 )
| ( nil != X1
& nil = sK37 ) )
& X1 = X3
& sK37 = X2 )
& ssList(X2) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f313,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) ) )
& app(X2,X4) = X3
& strictorderedP(X2) )
& ( nil = X3
| nil != X2 )
& ( ( nil != sK37
& nil = X1 )
| ( nil != X1
& nil = sK37 ) )
& X1 = X3
& sK37 = X2 )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) ) )
& app(X2,X4) = X3
& strictorderedP(X2) )
& ( nil = X3
| nil != X2 )
& ( ( nil != sK37
& nil = sK38 )
| ( nil != sK38
& nil = sK37 ) )
& sK38 = X3
& sK37 = X2 )
& ssList(X2) )
& ssList(sK38) ) ),
introduced(choice_axiom,[]) ).
fof(f314,plain,
( ? [X2] :
( ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) ) )
& app(X2,X4) = X3
& strictorderedP(X2) )
& ( nil = X3
| nil != X2 )
& ( ( nil != sK37
& nil = sK38 )
| ( nil != sK38
& nil = sK37 ) )
& sK38 = X3
& sK37 = X2 )
& ssList(X2) )
=> ( ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK39 )
| ~ ssItem(X7) ) ) )
& app(sK39,X4) = X3
& strictorderedP(sK39) )
& ( nil = X3
| nil != sK39 )
& ( ( nil != sK37
& nil = sK38 )
| ( nil != sK38
& nil = sK37 ) )
& sK38 = X3
& sK39 = sK37 )
& ssList(sK39) ) ),
introduced(choice_axiom,[]) ).
fof(f315,plain,
( ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK39 )
| ~ ssItem(X7) ) ) )
& app(sK39,X4) = X3
& strictorderedP(sK39) )
& ( nil = X3
| nil != sK39 )
& ( ( nil != sK37
& nil = sK38 )
| ( nil != sK38
& nil = sK37 ) )
& sK38 = X3
& sK39 = sK37 )
=> ( ssList(sK40)
& ? [X4] :
( ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK39 )
| ~ ssItem(X7) ) ) )
& app(sK39,X4) = sK40
& strictorderedP(sK39) )
& ( nil = sK40
| nil != sK39 )
& ( ( nil != sK37
& nil = sK38 )
| ( nil != sK38
& nil = sK37 ) )
& sK38 = sK40
& sK39 = sK37 ) ),
introduced(choice_axiom,[]) ).
fof(f316,plain,
( ? [X4] :
( ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK39 )
| ~ ssItem(X7) ) ) )
& app(sK39,X4) = sK40
& strictorderedP(sK39) )
=> ( ssList(sK41)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != sK41
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK39 )
| ~ ssItem(X7) ) ) )
& sK40 = app(sK39,sK41)
& strictorderedP(sK39) ) ),
introduced(choice_axiom,[]) ).
fof(f220,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) ) )
& app(X2,X4) = X3
& strictorderedP(X2) )
& ( nil = X3
| nil != X2 )
& ( ( nil != X0
& nil = X1 )
| ( nil != X1
& nil = X0 ) )
& X1 = X3
& X0 = X2 )
& ssList(X2) )
& ssList(X1) ) ),
inference(flattening,[],[f219]) ).
fof(f219,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X0
& nil = X1 )
| ( nil != X1
& nil = X0 ) )
& X0 = X2
& X1 = X3
& ( nil = X3
| nil != X2 )
& ? [X4] :
( app(X2,X4) = X3
& strictorderedP(X2)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) ) )
& ssList(X4) )
& 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 )
& ( nil != X1
| nil = X0 ) )
| X0 != X2
| X1 != X3
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ~ strictorderedP(X2)
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X0
| nil = X1 )
& ( nil != X1
| nil = X0 ) )
| X0 != X2
| X1 != X3
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ~ strictorderedP(X2)
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f497,plain,
ssList(sK39),
inference(cnf_transformation,[],[f317]) ).
fof(f420,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f168]) ).
fof(f168,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(ennf_transformation,[],[f84]) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax84) ).
fof(f698,plain,
( nil = app(sK37,nil)
| ~ spl58_2
| ~ spl58_4 ),
inference(backward_demodulation,[],[f619,f646]) ).
fof(f646,plain,
( nil = sK41
| ~ spl58_4 ),
inference(avatar_component_clause,[],[f644]) ).
fof(f644,plain,
( spl58_4
<=> nil = sK41 ),
introduced(avatar_definition,[new_symbols(naming,[spl58_4])]) ).
fof(f619,plain,
( nil = app(sK37,sK41)
| ~ spl58_2 ),
inference(backward_demodulation,[],[f564,f614]) ).
fof(f614,plain,
( nil = sK40
| ~ spl58_2 ),
inference(avatar_component_clause,[],[f612]) ).
fof(f612,plain,
( spl58_2
<=> nil = sK40 ),
introduced(avatar_definition,[new_symbols(naming,[spl58_2])]) ).
fof(f564,plain,
sK40 = app(sK37,sK41),
inference(definition_unfolding,[],[f506,f498]) ).
fof(f506,plain,
sK40 = app(sK39,sK41),
inference(cnf_transformation,[],[f317]) ).
fof(f695,plain,
( spl58_4
| ~ spl58_2 ),
inference(avatar_split_clause,[],[f694,f612,f644]) ).
fof(f694,plain,
( nil = sK41
| ~ spl58_2 ),
inference(subsumption_resolution,[],[f693,f508]) ).
fof(f508,plain,
ssList(sK41),
inference(cnf_transformation,[],[f317]) ).
fof(f693,plain,
( ~ ssList(sK41)
| nil = sK41
| ~ spl58_2 ),
inference(subsumption_resolution,[],[f692,f570]) ).
fof(f692,plain,
( ~ ssList(sK37)
| ~ ssList(sK41)
| nil = sK41
| ~ spl58_2 ),
inference(trivial_inequality_removal,[],[f687]) ).
fof(f687,plain,
( nil = sK41
| ~ ssList(sK41)
| ~ ssList(sK37)
| nil != nil
| ~ spl58_2 ),
inference(superposition,[],[f439,f619]) ).
fof(f439,plain,
! [X0,X1] :
( nil != app(X0,X1)
| nil = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f276]) ).
fof(f276,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) ) ) ),
inference(flattening,[],[f275]) ).
fof(f275,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f193]) ).
fof(f193,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) ) ) ),
inference(ennf_transformation,[],[f83]) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax83) ).
fof(f618,plain,
( spl58_1
| spl58_2 ),
inference(avatar_split_clause,[],[f569,f612,f608]) ).
fof(f569,plain,
( nil = sK40
| nil = sK37 ),
inference(definition_unfolding,[],[f500,f499]) ).
fof(f499,plain,
sK38 = sK40,
inference(cnf_transformation,[],[f317]) ).
fof(f500,plain,
( nil = sK38
| nil = sK37 ),
inference(cnf_transformation,[],[f317]) ).
fof(f616,plain,
( ~ spl58_1
| ~ spl58_2 ),
inference(avatar_split_clause,[],[f567,f612,f608]) ).
fof(f567,plain,
( nil != sK40
| nil != sK37 ),
inference(definition_unfolding,[],[f503,f499]) ).
fof(f503,plain,
( nil != sK37
| nil != sK38 ),
inference(cnf_transformation,[],[f317]) ).
fof(f615,plain,
( ~ spl58_1
| spl58_2 ),
inference(avatar_split_clause,[],[f566,f612,f608]) ).
fof(f566,plain,
( nil = sK40
| nil != sK37 ),
inference(definition_unfolding,[],[f504,f498]) ).
fof(f504,plain,
( nil = sK40
| nil != sK39 ),
inference(cnf_transformation,[],[f317]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC032+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 18:01:41 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.50 % (5182)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.19/0.50 % (5174)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.19/0.50 % (5166)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.19/0.51 % (5164)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.51 % (5162)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.19/0.51 % (5167)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.29/0.52 % (5163)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)
% 1.29/0.52 % (5167)Instruction limit reached!
% 1.29/0.52 % (5167)------------------------------
% 1.29/0.52 % (5167)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.29/0.52 % (5183)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)
% 1.29/0.52 % (5175)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)
% 1.29/0.52 % (5167)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.29/0.52 % (5167)Termination reason: Unknown
% 1.29/0.52 % (5167)Termination phase: Property scanning
% 1.29/0.52
% 1.29/0.52 % (5167)Memory used [KB]: 1279
% 1.29/0.52 % (5167)Time elapsed: 0.006 s
% 1.29/0.52 % (5167)Instructions burned: 8 (million)
% 1.29/0.52 % (5167)------------------------------
% 1.29/0.52 % (5167)------------------------------
% 1.29/0.53 % (5188)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 1.29/0.53 % (5186)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)
% 1.29/0.53 % (5189)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)
% 1.29/0.53 % (5160)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)
% 1.29/0.53 % (5187)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)
% 1.29/0.53 % (5165)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)
% 1.29/0.53 % (5168)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.29/0.53 % (5168)Instruction limit reached!
% 1.29/0.53 % (5168)------------------------------
% 1.29/0.53 % (5168)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.29/0.53 % (5168)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.29/0.53 % (5168)Termination reason: Unknown
% 1.29/0.53 % (5168)Termination phase: Preprocessing 2
% 1.29/0.53
% 1.29/0.53 % (5168)Memory used [KB]: 1023
% 1.29/0.53 % (5168)Time elapsed: 0.002 s
% 1.29/0.53 % (5168)Instructions burned: 2 (million)
% 1.29/0.53 % (5168)------------------------------
% 1.29/0.53 % (5168)------------------------------
% 1.42/0.53 TRYING [1]
% 1.42/0.54 TRYING [2]
% 1.42/0.54 % (5184)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 1.42/0.54 % (5179)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)
% 1.42/0.54 % (5180)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 1.42/0.54 % (5178)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.42/0.54 % (5181)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 1.42/0.54 % (5161)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)
% 1.42/0.54 % (5176)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)
% 1.42/0.54 % (5172)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 1.42/0.55 % (5170)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.42/0.55 % (5173)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.42/0.55 % (5171)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)
% 1.42/0.55 % (5169)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)
% 1.42/0.55 % (5177)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 1.42/0.56 % (5183)First to succeed.
% 1.42/0.56 % (5185)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 1.42/0.56 % (5183)Refutation found. Thanks to Tanya!
% 1.42/0.56 % SZS status Theorem for theBenchmark
% 1.42/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 1.42/0.56 % (5183)------------------------------
% 1.42/0.56 % (5183)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.42/0.56 % (5183)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.42/0.56 % (5183)Termination reason: Refutation
% 1.42/0.56
% 1.42/0.56 % (5183)Memory used [KB]: 6012
% 1.42/0.56 % (5183)Time elapsed: 0.150 s
% 1.42/0.56 % (5183)Instructions burned: 24 (million)
% 1.42/0.56 % (5183)------------------------------
% 1.42/0.56 % (5183)------------------------------
% 1.42/0.56 % (5159)Success in time 0.215 s
%------------------------------------------------------------------------------