TSTP Solution File: SWC277+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC277+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 : n029.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:42:52 EDT 2022
% Result : Theorem 1.60s 0.59s
% Output : Refutation 1.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 12
% Syntax : Number of formulae : 58 ( 17 unt; 0 def)
% Number of atoms : 244 ( 63 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 267 ( 81 ~; 72 |; 90 &)
% ( 6 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 63 ( 34 !; 29 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f897,plain,
$false,
inference(subsumption_resolution,[],[f888,f532]) ).
fof(f532,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f66]) ).
fof(f66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax66) ).
fof(f888,plain,
~ totalorderedP(nil),
inference(backward_demodulation,[],[f383,f886]) ).
fof(f886,plain,
nil = sK12,
inference(subsumption_resolution,[],[f885,f386]) ).
fof(f386,plain,
ssList(sK12),
inference(cnf_transformation,[],[f252]) ).
fof(f252,plain,
( ssList(sK12)
& ssList(sK13)
& ssList(sK15)
& ~ totalorderedP(sK12)
& segmentP(sK15,sK14)
& ( singletonP(sK14)
| ~ neq(sK15,nil) )
& sK15 = sK13
& sK14 = sK12
& ssList(sK14) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12,sK13,sK14,sK15])],[f125,f251,f250,f249,f248]) ).
fof(f248,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& ~ totalorderedP(X0)
& segmentP(X3,X2)
& ( singletonP(X2)
| ~ neq(X3,nil) )
& X1 = X3
& X0 = X2 )
& ssList(X2) ) ) )
=> ( ssList(sK12)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& ~ totalorderedP(sK12)
& segmentP(X3,X2)
& ( singletonP(X2)
| ~ neq(X3,nil) )
& X1 = X3
& sK12 = X2 )
& ssList(X2) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f249,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& ~ totalorderedP(sK12)
& segmentP(X3,X2)
& ( singletonP(X2)
| ~ neq(X3,nil) )
& X1 = X3
& sK12 = X2 )
& ssList(X2) ) )
=> ( ssList(sK13)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& ~ totalorderedP(sK12)
& segmentP(X3,X2)
& ( singletonP(X2)
| ~ neq(X3,nil) )
& sK13 = X3
& sK12 = X2 )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f250,plain,
( ? [X2] :
( ? [X3] :
( ssList(X3)
& ~ totalorderedP(sK12)
& segmentP(X3,X2)
& ( singletonP(X2)
| ~ neq(X3,nil) )
& sK13 = X3
& sK12 = X2 )
& ssList(X2) )
=> ( ? [X3] :
( ssList(X3)
& ~ totalorderedP(sK12)
& segmentP(X3,sK14)
& ( singletonP(sK14)
| ~ neq(X3,nil) )
& sK13 = X3
& sK14 = sK12 )
& ssList(sK14) ) ),
introduced(choice_axiom,[]) ).
fof(f251,plain,
( ? [X3] :
( ssList(X3)
& ~ totalorderedP(sK12)
& segmentP(X3,sK14)
& ( singletonP(sK14)
| ~ neq(X3,nil) )
& sK13 = X3
& sK14 = sK12 )
=> ( ssList(sK15)
& ~ totalorderedP(sK12)
& segmentP(sK15,sK14)
& ( singletonP(sK14)
| ~ neq(sK15,nil) )
& sK15 = sK13
& sK14 = sK12 ) ),
introduced(choice_axiom,[]) ).
fof(f125,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& ~ totalorderedP(X0)
& segmentP(X3,X2)
& ( singletonP(X2)
| ~ neq(X3,nil) )
& X1 = X3
& X0 = X2 )
& ssList(X2) ) ) ),
inference(flattening,[],[f124]) ).
fof(f124,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( singletonP(X2)
| ~ neq(X3,nil) )
& X1 = X3
& X0 = X2
& segmentP(X3,X2)
& ~ totalorderedP(X0)
& 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)
=> ( ( neq(X3,nil)
& ~ singletonP(X2) )
| X1 != X3
| X0 != X2
| ~ segmentP(X3,X2)
| totalorderedP(X0) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ~ singletonP(X2) )
| X1 != X3
| X0 != X2
| ~ segmentP(X3,X2)
| totalorderedP(X0) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f885,plain,
( nil = sK12
| ~ ssList(sK12) ),
inference(resolution,[],[f879,f359]) ).
fof(f359,plain,
! [X0] :
( ~ segmentP(nil,X0)
| ~ ssList(X0)
| nil = X0 ),
inference(cnf_transformation,[],[f236]) ).
fof(f236,plain,
! [X0] :
( ~ ssList(X0)
| ( ( nil = X0
| ~ segmentP(nil,X0) )
& ( segmentP(nil,X0)
| nil != X0 ) ) ),
inference(nnf_transformation,[],[f186]) ).
fof(f186,plain,
! [X0] :
( ~ ssList(X0)
| ( nil = X0
<=> segmentP(nil,X0) ) ),
inference(ennf_transformation,[],[f58]) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( nil = X0
<=> segmentP(nil,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax58) ).
fof(f879,plain,
segmentP(nil,sK12),
inference(backward_demodulation,[],[f595,f876]) ).
fof(f876,plain,
nil = sK13,
inference(subsumption_resolution,[],[f875,f823]) ).
fof(f823,plain,
( singletonP(sK12)
| nil = sK13 ),
inference(subsumption_resolution,[],[f822,f550]) ).
fof(f550,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f822,plain,
( ~ ssList(nil)
| nil = sK13
| singletonP(sK12) ),
inference(subsumption_resolution,[],[f817,f385]) ).
fof(f385,plain,
ssList(sK13),
inference(cnf_transformation,[],[f252]) ).
fof(f817,plain,
( singletonP(sK12)
| ~ ssList(sK13)
| ~ ssList(nil)
| nil = sK13 ),
inference(resolution,[],[f551,f596]) ).
fof(f596,plain,
( ~ neq(sK13,nil)
| singletonP(sK12) ),
inference(backward_demodulation,[],[f592,f379]) ).
fof(f379,plain,
sK14 = sK12,
inference(cnf_transformation,[],[f252]) ).
fof(f592,plain,
( singletonP(sK14)
| ~ neq(sK13,nil) ),
inference(backward_demodulation,[],[f381,f380]) ).
fof(f380,plain,
sK15 = sK13,
inference(cnf_transformation,[],[f252]) ).
fof(f381,plain,
( ~ neq(sK15,nil)
| singletonP(sK14) ),
inference(cnf_transformation,[],[f252]) ).
fof(f551,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X0)
| X0 = X1
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f347]) ).
fof(f347,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( X0 != X1
| ~ neq(X0,X1) )
& ( neq(X0,X1)
| X0 = X1 ) ) ) ),
inference(nnf_transformation,[],[f159]) ).
fof(f159,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( X0 != X1
<=> neq(X0,X1) ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( X0 != X1
<=> neq(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f875,plain,
( nil = sK13
| ~ singletonP(sK12) ),
inference(subsumption_resolution,[],[f874,f386]) ).
fof(f874,plain,
( ~ ssList(sK12)
| nil = sK13
| ~ singletonP(sK12) ),
inference(resolution,[],[f862,f491]) ).
fof(f491,plain,
! [X0] :
( ssItem(sK46(X0))
| ~ ssList(X0)
| ~ singletonP(X0) ),
inference(cnf_transformation,[],[f320]) ).
fof(f320,plain,
! [X0] :
( ~ ssList(X0)
| ( ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) )
& ( ( ssItem(sK46(X0))
& cons(sK46(X0),nil) = X0 )
| ~ singletonP(X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK46])],[f318,f319]) ).
fof(f319,plain,
! [X0] :
( ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X0 )
=> ( ssItem(sK46(X0))
& cons(sK46(X0),nil) = X0 ) ),
introduced(choice_axiom,[]) ).
fof(f318,plain,
! [X0] :
( ~ ssList(X0)
| ( ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) )
& ( ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X0 )
| ~ singletonP(X0) ) ) ),
inference(rectify,[],[f317]) ).
fof(f317,plain,
! [X0] :
( ~ ssList(X0)
| ( ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) )
& ( ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 )
| ~ singletonP(X0) ) ) ),
inference(nnf_transformation,[],[f206]) ).
fof(f206,plain,
! [X0] :
( ~ ssList(X0)
| ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
fof(f862,plain,
( ~ ssItem(sK46(sK12))
| nil = sK13 ),
inference(subsumption_resolution,[],[f848,f383]) ).
fof(f848,plain,
( nil = sK13
| ~ ssItem(sK46(sK12))
| totalorderedP(sK12) ),
inference(superposition,[],[f360,f847]) ).
fof(f847,plain,
( sK12 = cons(sK46(sK12),nil)
| nil = sK13 ),
inference(subsumption_resolution,[],[f846,f386]) ).
fof(f846,plain,
( ~ ssList(sK12)
| nil = sK13
| sK12 = cons(sK46(sK12),nil) ),
inference(resolution,[],[f823,f490]) ).
fof(f490,plain,
! [X0] :
( ~ singletonP(X0)
| cons(sK46(X0),nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f320]) ).
fof(f360,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f148]) ).
fof(f148,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f65]) ).
fof(f65,axiom,
! [X0] :
( ssItem(X0)
=> totalorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax65) ).
fof(f595,plain,
segmentP(sK13,sK12),
inference(backward_demodulation,[],[f593,f379]) ).
fof(f593,plain,
segmentP(sK13,sK14),
inference(backward_demodulation,[],[f382,f380]) ).
fof(f382,plain,
segmentP(sK15,sK14),
inference(cnf_transformation,[],[f252]) ).
fof(f383,plain,
~ totalorderedP(sK12),
inference(cnf_transformation,[],[f252]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SWC277+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % 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.33 % Computer : n029.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 30 18:52:12 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.50 % (23026)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.20/0.50 % (23018)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.20/0.51 % (23012)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.20/0.51 % (23006)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.20/0.51 % (23020)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.20/0.51 % (23019)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.20/0.51 % (23012)Instruction limit reached!
% 0.20/0.51 % (23012)------------------------------
% 0.20/0.51 % (23012)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (23012)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (23012)Termination reason: Unknown
% 0.20/0.51 % (23012)Termination phase: Preprocessing 2
% 0.20/0.51
% 0.20/0.51 % (23012)Memory used [KB]: 1023
% 0.20/0.51 % (23012)Time elapsed: 0.003 s
% 0.20/0.51 % (23012)Instructions burned: 2 (million)
% 0.20/0.51 % (23012)------------------------------
% 0.20/0.51 % (23012)------------------------------
% 0.20/0.51 % (23022)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.51 % (23014)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.52 % (23028)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.52 % (23008)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (23010)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.20/0.52 % (23031)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.20/0.53 % (23011)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.44/0.53 % (23007)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.44/0.53 % (23009)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.44/0.53 % (23029)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 1.44/0.53 % (23004)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.44/0.53 % (23021)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 1.44/0.54 % (23023)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.44/0.54 % (23017)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.44/0.54 % (23013)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.44/0.54 % (23015)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.44/0.54 % (23030)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.44/0.55 % (23005)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.44/0.55 % (23024)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.44/0.55 % (23011)Instruction limit reached!
% 1.44/0.55 % (23011)------------------------------
% 1.44/0.55 % (23011)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.44/0.55 % (23011)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.44/0.55 % (23011)Termination reason: Unknown
% 1.44/0.55 % (23011)Termination phase: Function definition elimination
% 1.44/0.55
% 1.44/0.55 % (23011)Memory used [KB]: 1279
% 1.44/0.55 % (23011)Time elapsed: 0.005 s
% 1.44/0.55 % (23011)Instructions burned: 8 (million)
% 1.44/0.55 % (23011)------------------------------
% 1.44/0.55 % (23011)------------------------------
% 1.60/0.55 % (23032)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 1.60/0.55 % (23016)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.60/0.56 TRYING [1]
% 1.60/0.56 % (23025)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 1.60/0.56 % (23027)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.60/0.57 % (23033)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.60/0.57 TRYING [2]
% 1.60/0.58 TRYING [1]
% 1.60/0.59 % (23019)First to succeed.
% 1.60/0.59 TRYING [1]
% 1.60/0.59 TRYING [2]
% 1.60/0.59 % (23006)Instruction limit reached!
% 1.60/0.59 % (23006)------------------------------
% 1.60/0.59 % (23006)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.60/0.59 % (23006)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.60/0.59 % (23006)Termination reason: Unknown
% 1.60/0.59 % (23006)Termination phase: Saturation
% 1.60/0.59
% 1.60/0.59 % (23006)Memory used [KB]: 1791
% 1.60/0.59 % (23006)Time elapsed: 0.188 s
% 1.60/0.59 % (23006)Instructions burned: 38 (million)
% 1.60/0.59 % (23006)------------------------------
% 1.60/0.59 % (23006)------------------------------
% 1.60/0.59 % (23019)Refutation found. Thanks to Tanya!
% 1.60/0.59 % SZS status Theorem for theBenchmark
% 1.60/0.59 % SZS output start Proof for theBenchmark
% See solution above
% 1.60/0.59 % (23019)------------------------------
% 1.60/0.59 % (23019)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.60/0.59 % (23019)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.60/0.59 % (23019)Termination reason: Refutation
% 1.60/0.59
% 1.60/0.59 % (23019)Memory used [KB]: 1791
% 1.60/0.59 % (23019)Time elapsed: 0.189 s
% 1.60/0.59 % (23019)Instructions burned: 34 (million)
% 1.60/0.59 % (23019)------------------------------
% 1.60/0.59 % (23019)------------------------------
% 1.60/0.59 % (23003)Success in time 0.245 s
%------------------------------------------------------------------------------