TSTP Solution File: DAT095_1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : DAT095_1 : TPTP v8.1.0. Released v6.1.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 : n002.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 16:04:09 EDT 2022
% Result : Theorem 0.20s 0.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 24
% Syntax : Number of formulae : 65 ( 18 unt; 16 typ; 0 def)
% Number of atoms : 133 ( 79 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 129 ( 45 ~; 42 |; 29 &)
% ( 5 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 159 ( 10 atm; 22 fun; 34 num; 93 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 25 ( 14 >; 11 *; 0 +; 0 <<)
% Number of predicates : 6 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 13 usr; 4 con; 0-2 aty)
% Number of variables : 166 ( 142 !; 24 ?; 166 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
list: $tType ).
tff(func_def_0,type,
nil: list ).
tff(func_def_1,type,
cons: ( $int * list ) > list ).
tff(func_def_2,type,
head: list > $int ).
tff(func_def_3,type,
tail: list > list ).
tff(func_def_5,type,
length: list > $int ).
tff(func_def_8,type,
count: ( $int * list ) > $int ).
tff(func_def_9,type,
append: ( list * list ) > list ).
tff(func_def_11,type,
sK0: ( list * $int ) > $int ).
tff(func_def_12,type,
sK1: ( list * $int ) > list ).
tff(func_def_13,type,
sK2: ( list * $int ) > $int ).
tff(func_def_14,type,
sK3: ( list * $int ) > list ).
tff(func_def_15,type,
sK4: ( $int * list ) > $int ).
tff(func_def_16,type,
sK5: ( $int * list ) > list ).
tff(pred_def_1,type,
in: ( $int * list ) > $o ).
tff(pred_def_2,type,
inRange: ( $int * list ) > $o ).
tff(f129,plain,
$false,
inference(evaluation,[],[f125]) ).
tff(f125,plain,
$sum(1,0) = $sum(2,0),
inference(superposition,[],[f117,f68]) ).
tff(f68,plain,
! [X0: $int] : ( 0 = count(X0,nil) ),
inference(cnf_transformation,[],[f9]) ).
tff(f9,axiom,
! [X0: $int] : ( 0 = count(X0,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a) ).
tff(f117,plain,
! [X2: list,X0: $int] : ( $sum(1,count(X0,X2)) = $sum(2,count(X0,X2)) ),
inference(evaluation,[],[f116]) ).
tff(f116,plain,
! [X2: list,X0: $int] : ( $sum(1,$sum(1,count(X0,X2))) = $sum(1,count(X0,X2)) ),
inference(forward_demodulation,[],[f113,f96]) ).
tff(f96,plain,
! [X2: list,X1: $int] : ( count(X1,cons(X1,X2)) = $sum(1,count(X1,X2)) ),
inference(backward_demodulation,[],[f95,f19]) ).
tff(f19,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(theory_axiom_140,[]) ).
tff(f95,plain,
! [X2: list,X1: $int] : ( $sum(count(X1,X2),1) = count(X1,cons(X1,X2)) ),
inference(equality_resolution,[],[f88]) ).
tff(f88,plain,
! [X2: list,X0: $int,X1: $int] :
( ( X0 != X1 )
| ( $sum(count(X0,X2),1) = count(X0,cons(X1,X2)) ) ),
inference(cnf_transformation,[],[f62]) ).
tff(f62,plain,
! [X0: $int,X1: $int,X2: list] :
( ( X0 != X1 )
| ( $sum(count(X0,X2),1) = count(X0,cons(X1,X2)) ) ),
inference(rectify,[],[f44]) ).
tff(f44,plain,
! [X1: $int,X0: $int,X2: list] :
( ( X0 != X1 )
| ( $sum(count(X1,X2),1) = count(X1,cons(X0,X2)) ) ),
inference(ennf_transformation,[],[f36]) ).
tff(f36,plain,
! [X2: list,X1: $int,X0: $int] :
( ( X0 = X1 )
=> ( $sum(count(X1,X2),1) = count(X1,cons(X0,X2)) ) ),
inference(rectify,[],[f11]) ).
tff(f11,axiom,
! [X3: $int,X0: $int,X4: list,X5: $int] :
( ( X0 = X3 )
=> ( count(X0,cons(X3,X4)) = $sum(count(X0,X4),1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_4) ).
tff(f113,plain,
! [X2: list,X0: $int] : ( $sum(1,count(X0,X2)) = $sum(1,count(X0,cons(X0,X2))) ),
inference(superposition,[],[f112,f98]) ).
tff(f98,plain,
! [X2: $int,X0: $int,X1: list] : ( $sum(1,count(X0,X1)) = count(X0,cons(X2,cons(X0,X1))) ),
inference(forward_demodulation,[],[f97,f96]) ).
tff(f97,plain,
! [X2: $int,X0: $int,X1: list] : ( count(X0,cons(X0,X1)) = count(X0,cons(X2,cons(X0,X1))) ),
inference(unit_resulting_resolution,[],[f92,f89]) ).
tff(f89,plain,
! [X3: list,X0: $int,X1: $int] :
( ~ in(X1,X3)
| ( count(X1,X3) = count(X1,cons(X0,X3)) ) ),
inference(equality_resolution,[],[f69]) ).
tff(f69,plain,
! [X2: list,X3: list,X0: $int,X1: $int] :
( ( cons(X0,X3) != X2 )
| ~ in(X1,X3)
| ( count(X1,X2) = count(X1,X3) ) ),
inference(cnf_transformation,[],[f49]) ).
tff(f49,plain,
! [X0: $int,X1: $int,X2: list,X3: list] :
( ( cons(X0,X3) != X2 )
| ~ in(X1,X3)
| ( count(X1,X2) = count(X1,X3) ) ),
inference(rectify,[],[f43]) ).
tff(f43,plain,
! [X3: $int,X2: $int,X1: list,X0: list] :
( ( cons(X3,X0) != X1 )
| ~ in(X2,X0)
| ( count(X2,X0) = count(X2,X1) ) ),
inference(flattening,[],[f42]) ).
tff(f42,plain,
! [X3: $int,X1: list,X2: $int,X0: list] :
( ( count(X2,X0) = count(X2,X1) )
| ( cons(X3,X0) != X1 )
| ~ in(X2,X0) ),
inference(ennf_transformation,[],[f41]) ).
tff(f41,plain,
! [X3: $int,X1: list,X2: $int,X0: list] :
( ( ( cons(X3,X0) = X1 )
& in(X2,X0) )
=> ( count(X2,X0) = count(X2,X1) ) ),
inference(flattening,[],[f40]) ).
tff(f40,plain,
~ ~ ! [X3: $int,X1: list,X2: $int,X0: list] :
( ( ( cons(X3,X0) = X1 )
& in(X2,X0) )
=> ( count(X2,X0) = count(X2,X1) ) ),
inference(rectify,[],[f16]) ).
tff(f16,negated_conjecture,
~ ~ ! [X1: list,X8: list,X5: $int,X7: $int] :
( ( in(X5,X1)
& ( cons(X7,X1) = X8 ) )
=> ( count(X5,X1) = count(X5,X8) ) ),
inference(negated_conjecture,[],[f15]) ).
tff(f15,conjecture,
~ ! [X1: list,X8: list,X5: $int,X7: $int] :
( ( in(X5,X1)
& ( cons(X7,X1) = X8 ) )
=> ( count(X5,X1) = count(X5,X8) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c) ).
tff(f92,plain,
! [X8: $int,X9: list] : in(X8,cons(X8,X9)),
inference(equality_resolution,[],[f91]) ).
tff(f91,plain,
! [X1: $int,X8: $int,X9: list] :
( in(X1,cons(X8,X9))
| ( X1 != X8 ) ),
inference(equality_resolution,[],[f75]) ).
tff(f75,plain,
! [X0: list,X1: $int,X8: $int,X9: list] :
( in(X1,X0)
| ( cons(X8,X9) != X0 )
| ( X1 != X8 ) ),
inference(cnf_transformation,[],[f56]) ).
tff(f56,plain,
! [X0: list,X1: $int] :
( ( ( in(X1,sK1(X0,X1))
& ( cons(sK0(X0,X1),sK1(X0,X1)) = X0 ) )
| ( ( cons(sK2(X0,X1),sK3(X0,X1)) = X0 )
& ( sK2(X0,X1) = X1 ) )
| ~ in(X1,X0) )
& ( in(X1,X0)
| ( ! [X6: $int,X7: list] :
( ~ in(X1,X7)
| ( cons(X6,X7) != X0 ) )
& ! [X8: $int,X9: list] :
( ( cons(X8,X9) != X0 )
| ( X1 != X8 ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f53,f55,f54]) ).
tff(f54,plain,
! [X0: list,X1: $int] :
( ? [X2: $int,X3: list] :
( in(X1,X3)
& ( cons(X2,X3) = X0 ) )
=> ( in(X1,sK1(X0,X1))
& ( cons(sK0(X0,X1),sK1(X0,X1)) = X0 ) ) ),
introduced(choice_axiom,[]) ).
tff(f55,plain,
! [X0: list,X1: $int] :
( ? [X4: $int,X5: list] :
( ( cons(X4,X5) = X0 )
& ( X1 = X4 ) )
=> ( ( cons(sK2(X0,X1),sK3(X0,X1)) = X0 )
& ( sK2(X0,X1) = X1 ) ) ),
introduced(choice_axiom,[]) ).
tff(f53,plain,
! [X0: list,X1: $int] :
( ( ? [X2: $int,X3: list] :
( in(X1,X3)
& ( cons(X2,X3) = X0 ) )
| ? [X4: $int,X5: list] :
( ( cons(X4,X5) = X0 )
& ( X1 = X4 ) )
| ~ in(X1,X0) )
& ( in(X1,X0)
| ( ! [X6: $int,X7: list] :
( ~ in(X1,X7)
| ( cons(X6,X7) != X0 ) )
& ! [X8: $int,X9: list] :
( ( cons(X8,X9) != X0 )
| ( X1 != X8 ) ) ) ) ),
inference(rectify,[],[f52]) ).
tff(f52,plain,
! [X0: list,X1: $int] :
( ( ? [X4: $int,X5: list] :
( in(X1,X5)
& ( cons(X4,X5) = X0 ) )
| ? [X3: $int,X2: list] :
( ( cons(X3,X2) = X0 )
& ( X1 = X3 ) )
| ~ in(X1,X0) )
& ( in(X1,X0)
| ( ! [X4: $int,X5: list] :
( ~ in(X1,X5)
| ( cons(X4,X5) != X0 ) )
& ! [X3: $int,X2: list] :
( ( cons(X3,X2) != X0 )
| ( X1 != X3 ) ) ) ) ),
inference(flattening,[],[f51]) ).
tff(f51,plain,
! [X0: list,X1: $int] :
( ( ? [X4: $int,X5: list] :
( in(X1,X5)
& ( cons(X4,X5) = X0 ) )
| ? [X3: $int,X2: list] :
( ( cons(X3,X2) = X0 )
& ( X1 = X3 ) )
| ~ in(X1,X0) )
& ( in(X1,X0)
| ( ! [X4: $int,X5: list] :
( ~ in(X1,X5)
| ( cons(X4,X5) != X0 ) )
& ! [X3: $int,X2: list] :
( ( cons(X3,X2) != X0 )
| ( X1 != X3 ) ) ) ) ),
inference(nnf_transformation,[],[f37]) ).
tff(f37,plain,
! [X0: list,X1: $int] :
( ( ? [X4: $int,X5: list] :
( in(X1,X5)
& ( cons(X4,X5) = X0 ) )
| ? [X3: $int,X2: list] :
( ( cons(X3,X2) = X0 )
& ( X1 = X3 ) ) )
<=> in(X1,X0) ),
inference(rectify,[],[f5]) ).
tff(f5,axiom,
! [X1: list,X2: $int] :
( in(X2,X1)
<=> ( ? [X4: list,X3: $int] :
( ( cons(X3,X4) = X1 )
& ( X2 = X3 ) )
| ? [X3: $int,X4: list] :
( ( cons(X3,X4) = X1 )
& in(X2,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in_conv) ).
tff(f112,plain,
! [X2: list,X3: $int,X0: $int,X1: $int] : ( $sum(1,count(X0,X2)) = count(X0,cons(X3,cons(X1,cons(X0,X2)))) ),
inference(forward_demodulation,[],[f110,f98]) ).
tff(f110,plain,
! [X2: list,X3: $int,X0: $int,X1: $int] : ( count(X0,cons(X1,cons(X0,X2))) = count(X0,cons(X3,cons(X1,cons(X0,X2)))) ),
inference(unit_resulting_resolution,[],[f108,f89]) ).
tff(f108,plain,
! [X2: $int,X3: list,X1: $int] : in(X1,cons(X2,cons(X1,X3))),
inference(subsumption_resolution,[],[f107,f105]) ).
tff(f105,plain,
! [X0: $int,X1: list] : $less(0,$sum(1,count(X0,X1))),
inference(forward_demodulation,[],[f104,f96]) ).
tff(f104,plain,
! [X0: $int,X1: list] : $less(0,count(X0,cons(X0,X1))),
inference(unit_resulting_resolution,[],[f92,f71]) ).
tff(f71,plain,
! [X0: list,X1: $int] :
( ~ in(X1,X0)
| $less(0,count(X1,X0)) ),
inference(cnf_transformation,[],[f50]) ).
tff(f50,plain,
! [X0: list,X1: $int] :
( ( in(X1,X0)
| ~ $less(0,count(X1,X0)) )
& ( $less(0,count(X1,X0))
| ~ in(X1,X0) ) ),
inference(nnf_transformation,[],[f39]) ).
tff(f39,plain,
! [X0: list,X1: $int] :
( in(X1,X0)
<=> $less(0,count(X1,X0)) ),
inference(rectify,[],[f18]) ).
tff(f18,plain,
! [X1: list,X5: $int] :
( $less(0,count(X5,X1))
<=> in(X5,X1) ),
inference(theory_normalization,[],[f14]) ).
tff(f14,axiom,
! [X1: list,X5: $int] :
( $greater(count(X5,X1),0)
<=> in(X5,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_8) ).
tff(f107,plain,
! [X2: $int,X3: list,X1: $int] :
( in(X1,cons(X2,cons(X1,X3)))
| ~ $less(0,$sum(1,count(X1,X3))) ),
inference(superposition,[],[f72,f98]) ).
tff(f72,plain,
! [X0: list,X1: $int] :
( ~ $less(0,count(X1,X0))
| in(X1,X0) ),
inference(cnf_transformation,[],[f50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : DAT095=1 : TPTP v8.1.0. Released v6.1.0.
% 0.10/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.13/0.34 % Computer : n002.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 : Mon Aug 29 20:33:43 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.47 % (5723)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.48 % (5742)dis+10_1:64_nwc=1.4:rp=on:tha=off:i=21:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/21Mi)
% 0.20/0.49 % (5731)dis+32_1:1_bd=off:nm=4:sos=on:ss=included:i=4:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.20/0.49 % (5723)Instruction limit reached!
% 0.20/0.49 % (5723)------------------------------
% 0.20/0.49 % (5723)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49 % (5723)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.49 % (5723)Termination reason: Unknown
% 0.20/0.49 % (5723)Termination phase: Preprocessing 3
% 0.20/0.49
% 0.20/0.49 % (5723)Memory used [KB]: 1023
% 0.20/0.49 % (5723)Time elapsed: 0.003 s
% 0.20/0.49 % (5723)Instructions burned: 3 (million)
% 0.20/0.49 % (5723)------------------------------
% 0.20/0.49 % (5723)------------------------------
% 0.20/0.49 % (5731)Refutation not found, incomplete strategy% (5731)------------------------------
% 0.20/0.49 % (5731)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49 % (5731)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.49 % (5731)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.49
% 0.20/0.49 % (5731)Memory used [KB]: 5500
% 0.20/0.49 % (5731)Time elapsed: 0.097 s
% 0.20/0.49 % (5731)Instructions burned: 3 (million)
% 0.20/0.49 % (5731)------------------------------
% 0.20/0.49 % (5731)------------------------------
% 0.20/0.50 % (5725)lrs+10_1:32_s2a=on:s2agt=10:sgt=8:ss=axioms:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.20/0.50 % (5724)ott+1011_1:2_br=off:bs=unit_only:bsr=unit_only:nwc=5.0:s2a=on:s2agt=32:urr=on:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.51 % (5742)Instruction limit reached!
% 0.20/0.51 % (5742)------------------------------
% 0.20/0.51 % (5742)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (5726)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=32:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/32Mi)
% 0.20/0.51 % (5742)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (5742)Termination reason: Unknown
% 0.20/0.51 % (5742)Termination phase: Saturation
% 0.20/0.51
% 0.20/0.51 % (5742)Memory used [KB]: 5884
% 0.20/0.51 % (5742)Time elapsed: 0.113 s
% 0.20/0.51 % (5742)Instructions burned: 21 (million)
% 0.20/0.51 % (5742)------------------------------
% 0.20/0.51 % (5742)------------------------------
% 0.20/0.52 % (5735)dis+20_1:12_aac=none:acc=model:awrs=converge:fd=preordered:fsr=off:nicw=on:nwc=3.0:s2a=on:s2agt=16:spb=goal:to=lpo:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.52 % (5733)dis+10_1:64_nwc=1.4:tha=off:i=21:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/21Mi)
% 0.20/0.52 % (5732)lrs+10_1:1_ep=R:gve=force:plsq=on:plsqr=32,1:uwa=one_side_interpreted:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.52 % (5727)lrs+1010_1:1_bd=off:fd=off:fde=none:ins=3:sac=on:sos=on:spb=goal:to=lpo:i=36:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/36Mi)
% 0.20/0.52 % (5720)lrs+1010_1:1_aac=none:bce=on:nicw=on:nm=0:plsq=on:plsql=on:sac=on:sos=on:sp=frequency:spb=units:to=lpo:i=34:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/34Mi)
% 0.20/0.52 % (5730)lrs+10_1:1_canc=force:tha=some:to=lpo:i=35:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/35Mi)
% 0.20/0.52 % (5722)dis+1011_1:64_drc=off:flr=on:nwc=2.0:sac=on:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.20/0.52 % (5750)dis+1011_1:1_bd=off:canc=force:ev=cautious:nwc=5.0:i=21:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/21Mi)
% 0.20/0.52 % (5724)First to succeed.
% 0.20/0.52 % (5735)Instruction limit reached!
% 0.20/0.52 % (5735)------------------------------
% 0.20/0.52 % (5735)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (5719)dis+1010_1:4_aac=none:abs=on:atotf=0.5:avsq=on:avsqc=2:avsqr=215,247:awrs=converge:awrsf=128:bsd=on:erd=off:fde=none:gve=cautious:newcnf=on:nwc=5.0:rnwc=on:sac=on:sas=z3:sp=const_min:tgt=ground:thsq=on:thsqc=64:thsqr=1,4:i=59848:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59848Mi)
% 0.20/0.53 % (5735)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (5735)Termination reason: Unknown
% 0.20/0.53 % (5735)Termination phase: Preprocessing 2
% 0.20/0.53
% 0.20/0.53 % (5735)Memory used [KB]: 895
% 0.20/0.53 % (5735)Time elapsed: 0.003 s
% 0.20/0.53 % (5735)Instructions burned: 2 (million)
% 0.20/0.53 % (5735)------------------------------
% 0.20/0.53 % (5735)------------------------------
% 0.20/0.53 % (5724)Refutation found. Thanks to Tanya!
% 0.20/0.53 % SZS status Theorem for theBenchmark
% 0.20/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.53 % (5724)------------------------------
% 0.20/0.53 % (5724)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (5724)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (5724)Termination reason: Refutation
% 0.20/0.53
% 0.20/0.53 % (5724)Memory used [KB]: 5628
% 0.20/0.53 % (5724)Time elapsed: 0.119 s
% 0.20/0.53 % (5724)Instructions burned: 6 (million)
% 0.20/0.53 % (5724)------------------------------
% 0.20/0.53 % (5724)------------------------------
% 0.20/0.53 % (5715)Success in time 0.176 s
%------------------------------------------------------------------------------