TSTP Solution File: SWV487+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV487+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n025.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 : Tue May 21 06:01:39 EDT 2024
% Result : Theorem 0.72s 0.83s
% Output : Refutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 68 ( 8 unt; 0 def)
% Number of atoms : 279 ( 52 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 356 ( 145 ~; 139 |; 52 &)
% ( 5 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 106 ( 96 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f710,plain,
$false,
inference(avatar_sat_refutation,[],[f176,f304,f709]) ).
fof(f709,plain,
spl3_4,
inference(avatar_contradiction_clause,[],[f708]) ).
fof(f708,plain,
( $false
| spl3_4 ),
inference(subsumption_resolution,[],[f700,f478]) ).
fof(f478,plain,
( ~ int_less(sK1,n)
| spl3_4 ),
inference(resolution,[],[f175,f49]) ).
fof(f49,plain,
! [X0,X1] :
( int_leq(X0,X1)
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1] :
( ( int_leq(X0,X1)
| ( X0 != X1
& ~ int_less(X0,X1) ) )
& ( X0 = X1
| int_less(X0,X1)
| ~ int_leq(X0,X1) ) ),
inference(flattening,[],[f32]) ).
fof(f32,plain,
! [X0,X1] :
( ( int_leq(X0,X1)
| ( X0 != X1
& ~ int_less(X0,X1) ) )
& ( X0 = X1
| int_less(X0,X1)
| ~ int_leq(X0,X1) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( int_leq(X0,X1)
<=> ( X0 = X1
| int_less(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_leq) ).
fof(f175,plain,
( ~ int_leq(sK1,n)
| spl3_4 ),
inference(avatar_component_clause,[],[f173]) ).
fof(f173,plain,
( spl3_4
<=> int_leq(sK1,n) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
fof(f700,plain,
( int_less(sK1,n)
| spl3_4 ),
inference(superposition,[],[f38,f685]) ).
fof(f685,plain,
( n = sK0
| spl3_4 ),
inference(subsumption_resolution,[],[f684,f39]) ).
fof(f39,plain,
int_leq(sK0,n),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
( real_zero != a(sK0,sK1)
& int_leq(sK0,n)
& int_less(sK1,sK0)
& int_leq(int_one,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f20,f26]) ).
fof(f26,plain,
( ? [X0,X1] :
( real_zero != a(X0,X1)
& int_leq(X0,n)
& int_less(X1,X0)
& int_leq(int_one,X1) )
=> ( real_zero != a(sK0,sK1)
& int_leq(sK0,n)
& int_less(sK1,sK0)
& int_leq(int_one,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
? [X0,X1] :
( real_zero != a(X0,X1)
& int_leq(X0,n)
& int_less(X1,X0)
& int_leq(int_one,X1) ),
inference(flattening,[],[f19]) ).
fof(f19,plain,
? [X0,X1] :
( real_zero != a(X0,X1)
& int_leq(X0,n)
& int_less(X1,X0)
& int_leq(int_one,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] :
( ( int_leq(X0,n)
& int_less(X1,X0)
& int_leq(int_one,X1) )
=> real_zero = a(X0,X1) ),
inference(negated_conjecture,[],[f13]) ).
fof(f13,conjecture,
! [X0,X1] :
( ( int_leq(X0,n)
& int_less(X1,X0)
& int_leq(int_one,X1) )
=> real_zero = a(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ut) ).
fof(f684,plain,
( n = sK0
| ~ int_leq(sK0,n)
| spl3_4 ),
inference(resolution,[],[f549,f48]) ).
fof(f48,plain,
! [X0,X1] :
( int_less(X0,X1)
| X0 = X1
| ~ int_leq(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f549,plain,
( ~ int_less(sK0,n)
| spl3_4 ),
inference(resolution,[],[f522,f38]) ).
fof(f522,plain,
( ! [X0] :
( ~ int_less(sK1,X0)
| ~ int_less(X0,n) )
| spl3_4 ),
inference(resolution,[],[f478,f56]) ).
fof(f56,plain,
! [X2,X0,X1] :
( int_less(X0,X2)
| ~ int_less(X1,X2)
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1,X2] :
( int_less(X0,X2)
| ~ int_less(X1,X2)
| ~ int_less(X0,X1) ),
inference(flattening,[],[f24]) ).
fof(f24,plain,
! [X0,X1,X2] :
( int_less(X0,X2)
| ~ int_less(X1,X2)
| ~ int_less(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( int_less(X1,X2)
& int_less(X0,X1) )
=> int_less(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_less_transitive) ).
fof(f38,plain,
int_less(sK1,sK0),
inference(cnf_transformation,[],[f27]) ).
fof(f304,plain,
spl3_3,
inference(avatar_contradiction_clause,[],[f303]) ).
fof(f303,plain,
( $false
| spl3_3 ),
inference(subsumption_resolution,[],[f301,f37]) ).
fof(f37,plain,
int_leq(int_one,sK1),
inference(cnf_transformation,[],[f27]) ).
fof(f301,plain,
( ~ int_leq(int_one,sK1)
| spl3_3 ),
inference(resolution,[],[f230,f38]) ).
fof(f230,plain,
( ! [X0] :
( ~ int_less(X0,sK0)
| ~ int_leq(int_one,X0) )
| spl3_3 ),
inference(resolution,[],[f180,f52]) ).
fof(f52,plain,
! [X0] :
( int_less(int_zero,X0)
| ~ int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f34,plain,
! [X0] :
( ( int_less(int_zero,X0)
| ~ int_leq(int_one,X0) )
& ( int_leq(int_one,X0)
| ~ int_less(int_zero,X0) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X0] :
( int_less(int_zero,X0)
<=> int_leq(int_one,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',one_successor_of_zero) ).
fof(f180,plain,
( ! [X0] :
( ~ int_less(int_zero,X0)
| ~ int_less(X0,sK0) )
| spl3_3 ),
inference(resolution,[],[f177,f56]) ).
fof(f177,plain,
( ~ int_less(int_zero,sK0)
| spl3_3 ),
inference(resolution,[],[f171,f51]) ).
fof(f51,plain,
! [X0] :
( int_leq(int_one,X0)
| ~ int_less(int_zero,X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f171,plain,
( ~ int_leq(int_one,sK0)
| spl3_3 ),
inference(avatar_component_clause,[],[f169]) ).
fof(f169,plain,
( spl3_3
<=> int_leq(int_one,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f176,plain,
( ~ spl3_3
| ~ spl3_4 ),
inference(avatar_split_clause,[],[f167,f173,f169]) ).
fof(f167,plain,
( ~ int_leq(sK1,n)
| ~ int_leq(int_one,sK0) ),
inference(subsumption_resolution,[],[f166,f38]) ).
fof(f166,plain,
( ~ int_leq(sK1,n)
| ~ int_leq(int_one,sK0)
| ~ int_less(sK1,sK0) ),
inference(subsumption_resolution,[],[f165,f39]) ).
fof(f165,plain,
( ~ int_leq(sK1,n)
| ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK0)
| ~ int_less(sK1,sK0) ),
inference(subsumption_resolution,[],[f162,f37]) ).
fof(f162,plain,
( ~ int_leq(int_one,sK1)
| ~ int_leq(sK1,n)
| ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK0)
| ~ int_less(sK1,sK0) ),
inference(trivial_inequality_removal,[],[f157]) ).
fof(f157,plain,
( real_zero != real_zero
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK1,n)
| ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK0)
| ~ int_less(sK1,sK0) ),
inference(superposition,[],[f40,f99]) ).
fof(f99,plain,
! [X0,X1] :
( real_zero = a(X1,X0)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_less(X0,X1) ),
inference(subsumption_resolution,[],[f98,f61]) ).
fof(f61,plain,
! [X1] : int_leq(X1,X1),
inference(equality_resolution,[],[f50]) ).
fof(f50,plain,
! [X0,X1] :
( int_leq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f33]) ).
fof(f98,plain,
! [X0,X1] :
( ~ int_leq(X1,n)
| ~ int_leq(X0,X0)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| real_zero = a(X1,X0)
| ~ int_leq(int_one,X1)
| ~ int_less(X0,X1) ),
inference(duplicate_literal_removal,[],[f95]) ).
fof(f95,plain,
! [X0,X1] :
( ~ int_leq(X1,n)
| ~ int_leq(X0,X0)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0)
| real_zero = a(X1,X0)
| ~ int_leq(int_one,X1)
| ~ int_less(X0,X1)
| ~ int_less(X0,X1) ),
inference(superposition,[],[f67,f42]) ).
fof(f42,plain,
! [X0,X1] :
( plus(X0,sK2(X0,X1)) = X1
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0,X1] :
( ( int_less(X0,X1)
| ! [X2] :
( ~ int_less(int_zero,X2)
| plus(X0,X2) != X1 ) )
& ( ( int_less(int_zero,sK2(X0,X1))
& plus(X0,sK2(X0,X1)) = X1 )
| ~ int_less(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f29,f30]) ).
fof(f30,plain,
! [X0,X1] :
( ? [X3] :
( int_less(int_zero,X3)
& plus(X0,X3) = X1 )
=> ( int_less(int_zero,sK2(X0,X1))
& plus(X0,sK2(X0,X1)) = X1 ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
! [X0,X1] :
( ( int_less(X0,X1)
| ! [X2] :
( ~ int_less(int_zero,X2)
| plus(X0,X2) != X1 ) )
& ( ? [X3] :
( int_less(int_zero,X3)
& plus(X0,X3) = X1 )
| ~ int_less(X0,X1) ) ),
inference(rectify,[],[f28]) ).
fof(f28,plain,
! [X0,X1] :
( ( int_less(X0,X1)
| ! [X2] :
( ~ int_less(int_zero,X2)
| plus(X0,X2) != X1 ) )
& ( ? [X2] :
( int_less(int_zero,X2)
& plus(X0,X2) = X1 )
| ~ int_less(X0,X1) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0,X1] :
( int_less(X0,X1)
<=> ? [X2] :
( int_less(int_zero,X2)
& plus(X0,X2) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_and_inverse) ).
fof(f67,plain,
! [X2,X0,X1] :
( ~ int_leq(plus(X2,sK2(X0,X1)),n)
| ~ int_leq(X0,X2)
| ~ int_leq(int_one,X0)
| ~ int_leq(X2,n)
| ~ int_leq(int_one,X2)
| real_zero = a(X1,X0)
| ~ int_leq(int_one,plus(X2,sK2(X0,X1)))
| ~ int_less(X0,X1) ),
inference(subsumption_resolution,[],[f63,f43]) ).
fof(f43,plain,
! [X0,X1] :
( int_less(int_zero,sK2(X0,X1))
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f63,plain,
! [X2,X0,X1] :
( real_zero = a(X1,X0)
| ~ int_leq(X0,X2)
| ~ int_leq(int_one,X0)
| ~ int_less(int_zero,sK2(X0,X1))
| ~ int_leq(X2,n)
| ~ int_leq(int_one,X2)
| ~ int_leq(plus(X2,sK2(X0,X1)),n)
| ~ int_leq(int_one,plus(X2,sK2(X0,X1)))
| ~ int_less(X0,X1) ),
inference(superposition,[],[f58,f42]) ).
fof(f58,plain,
! [X1,X4,X5] :
( real_zero = a(plus(X5,X4),X5)
| ~ int_leq(X5,X1)
| ~ int_leq(int_one,X5)
| ~ int_less(int_zero,X4)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(plus(X1,X4),n)
| ~ int_leq(int_one,plus(X1,X4)) ),
inference(equality_resolution,[],[f35]) ).
fof(f35,plain,
! [X0,X1,X4,X5] :
( real_zero = a(plus(X5,X4),X5)
| ~ int_leq(X5,X1)
| ~ int_leq(int_one,X5)
| plus(X1,X4) != X0
| ~ int_less(int_zero,X4)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( ( ! [X2] :
( ! [X3] :
( a(X3,plus(X3,X2)) = lu(X3,plus(X3,X2))
| ~ int_leq(X3,X0)
| ~ int_leq(int_one,X3) )
| plus(X0,X2) != X1
| ~ int_leq(int_zero,X2) )
& ! [X4] :
( ! [X5] :
( real_zero = a(plus(X5,X4),X5)
| ~ int_leq(X5,X1)
| ~ int_leq(int_one,X5) )
| plus(X1,X4) != X0
| ~ int_less(int_zero,X4) ) )
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) ),
inference(flattening,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( ( ! [X2] :
( ! [X3] :
( a(X3,plus(X3,X2)) = lu(X3,plus(X3,X2))
| ~ int_leq(X3,X0)
| ~ int_leq(int_one,X3) )
| plus(X0,X2) != X1
| ~ int_leq(int_zero,X2) )
& ! [X4] :
( ! [X5] :
( real_zero = a(plus(X5,X4),X5)
| ~ int_leq(X5,X1)
| ~ int_leq(int_one,X5) )
| plus(X1,X4) != X0
| ~ int_less(int_zero,X4) ) )
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ( int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(X0,n)
& int_leq(int_one,X0) )
=> ( ! [X2] :
( ( plus(X0,X2) = X1
& int_leq(int_zero,X2) )
=> ! [X3] :
( ( int_leq(X3,X0)
& int_leq(int_one,X3) )
=> a(X3,plus(X3,X2)) = lu(X3,plus(X3,X2)) ) )
& ! [X4] :
( ( plus(X1,X4) = X0
& int_less(int_zero,X4) )
=> ! [X5] :
( ( int_leq(X5,X1)
& int_leq(int_one,X5) )
=> real_zero = a(plus(X5,X4),X5) ) ) ) ),
inference(rectify,[],[f12]) ).
fof(f12,axiom,
! [X0,X1] :
( ( int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(X0,n)
& int_leq(int_one,X0) )
=> ( ! [X7] :
( ( plus(X0,X7) = X1
& int_leq(int_zero,X7) )
=> ! [X2] :
( ( int_leq(X2,X0)
& int_leq(int_one,X2) )
=> a(X2,plus(X2,X7)) = lu(X2,plus(X2,X7)) ) )
& ! [X7] :
( ( plus(X1,X7) = X0
& int_less(int_zero,X7) )
=> ! [X2] :
( ( int_leq(X2,X1)
& int_leq(int_one,X2) )
=> real_zero = a(plus(X2,X7),X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qiu) ).
fof(f40,plain,
real_zero != a(sK0,sK1),
inference(cnf_transformation,[],[f27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SWV487+1 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.11/0.32 % Computer : n025.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun May 19 07:34:07 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 This is a FOF_THM_RFO_SEQ problem
% 0.11/0.32 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.60/0.78 % (23803)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.60/0.78 % (23798)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2995ds/34Mi)
% 0.60/0.78 % (23800)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.60/0.78 % (23801)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.60/0.78 % (23799)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2995ds/51Mi)
% 0.60/0.78 % (23802)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2995ds/34Mi)
% 0.60/0.78 % (23804)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2995ds/83Mi)
% 0.60/0.78 % (23805)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.60/0.78 % (23805)Refutation not found, incomplete strategy% (23805)------------------------------
% 0.60/0.78 % (23805)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78 % (23805)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.78
% 0.60/0.78 % (23805)Memory used [KB]: 1039
% 0.60/0.78 % (23805)Time elapsed: 0.003 s
% 0.60/0.78 % (23805)Instructions burned: 3 (million)
% 0.60/0.78 % (23805)------------------------------
% 0.60/0.78 % (23805)------------------------------
% 0.60/0.79 % (23806)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2995ds/55Mi)
% 0.60/0.80 % (23801)Instruction limit reached!
% 0.60/0.80 % (23801)------------------------------
% 0.60/0.80 % (23801)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.80 % (23801)Termination reason: Unknown
% 0.60/0.80 % (23801)Termination phase: Saturation
% 0.60/0.80
% 0.60/0.80 % (23801)Memory used [KB]: 1415
% 0.60/0.80 % (23801)Time elapsed: 0.018 s
% 0.60/0.80 % (23801)Instructions burned: 33 (million)
% 0.60/0.80 % (23801)------------------------------
% 0.60/0.80 % (23801)------------------------------
% 0.60/0.80 % (23798)Instruction limit reached!
% 0.60/0.80 % (23798)------------------------------
% 0.60/0.80 % (23798)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.80 % (23798)Termination reason: Unknown
% 0.60/0.80 % (23798)Termination phase: Saturation
% 0.60/0.80
% 0.60/0.80 % (23798)Memory used [KB]: 1182
% 0.60/0.80 % (23798)Time elapsed: 0.019 s
% 0.60/0.80 % (23798)Instructions burned: 35 (million)
% 0.60/0.80 % (23798)------------------------------
% 0.60/0.80 % (23798)------------------------------
% 0.60/0.80 % (23802)Instruction limit reached!
% 0.60/0.80 % (23802)------------------------------
% 0.60/0.80 % (23802)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.80 % (23802)Termination reason: Unknown
% 0.60/0.80 % (23802)Termination phase: Saturation
% 0.60/0.80
% 0.60/0.80 % (23802)Memory used [KB]: 1206
% 0.60/0.80 % (23802)Time elapsed: 0.019 s
% 0.60/0.80 % (23802)Instructions burned: 34 (million)
% 0.60/0.80 % (23802)------------------------------
% 0.60/0.80 % (23802)------------------------------
% 0.60/0.80 % (23803)Instruction limit reached!
% 0.60/0.80 % (23803)------------------------------
% 0.60/0.80 % (23803)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.80 % (23803)Termination reason: Unknown
% 0.60/0.80 % (23803)Termination phase: Saturation
% 0.60/0.80
% 0.60/0.80 % (23803)Memory used [KB]: 1188
% 0.60/0.80 % (23803)Time elapsed: 0.020 s
% 0.60/0.80 % (23803)Instructions burned: 47 (million)
% 0.60/0.80 % (23803)------------------------------
% 0.60/0.80 % (23803)------------------------------
% 0.60/0.80 % (23807)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on theBenchmark for (2995ds/50Mi)
% 0.60/0.80 % (23808)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on theBenchmark for (2995ds/208Mi)
% 0.60/0.80 % (23809)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on theBenchmark for (2995ds/52Mi)
% 0.60/0.80 % (23810)lrs-1010_1:1_to=lpo:sil=2000:sp=reverse_arity:sos=on:urr=ec_only:i=518:sd=2:bd=off:ss=axioms:sgt=16_0 on theBenchmark for (2995ds/518Mi)
% 0.60/0.81 % (23799)Instruction limit reached!
% 0.60/0.81 % (23799)------------------------------
% 0.60/0.81 % (23799)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.81 % (23799)Termination reason: Unknown
% 0.60/0.81 % (23799)Termination phase: Saturation
% 0.60/0.81
% 0.60/0.81 % (23799)Memory used [KB]: 1389
% 0.60/0.81 % (23799)Time elapsed: 0.029 s
% 0.60/0.81 % (23799)Instructions burned: 51 (million)
% 0.60/0.81 % (23799)------------------------------
% 0.60/0.81 % (23799)------------------------------
% 0.60/0.81 % (23811)lrs+1011_87677:1048576_sil=8000:sos=on:spb=non_intro:nwc=10.0:kmz=on:i=42:ep=RS:nm=0:ins=1:uhcvi=on:rawr=on:fde=unused:afp=2000:afq=1.444:plsq=on:nicw=on_0 on theBenchmark for (2995ds/42Mi)
% 0.72/0.81 % (23806)Instruction limit reached!
% 0.72/0.81 % (23806)------------------------------
% 0.72/0.81 % (23806)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.72/0.81 % (23806)Termination reason: Unknown
% 0.72/0.81 % (23806)Termination phase: Saturation
% 0.72/0.81
% 0.72/0.81 % (23806)Memory used [KB]: 1790
% 0.72/0.81 % (23806)Time elapsed: 0.029 s
% 0.72/0.81 % (23806)Instructions burned: 56 (million)
% 0.72/0.81 % (23806)------------------------------
% 0.72/0.81 % (23806)------------------------------
% 0.72/0.82 % (23812)dis+1011_1258907:1048576_bsr=unit_only:to=lpo:drc=off:sil=2000:tgt=full:fde=none:sp=frequency:spb=goal:rnwc=on:nwc=6.70083:sac=on:newcnf=on:st=2:i=243:bs=unit_only:sd=3:afp=300:awrs=decay:awrsf=218:nm=16:ins=3:afq=3.76821:afr=on:ss=axioms:sgt=5:rawr=on:add=off:bsd=on_0 on theBenchmark for (2995ds/243Mi)
% 0.72/0.82 % (23804)Instruction limit reached!
% 0.72/0.82 % (23804)------------------------------
% 0.72/0.82 % (23804)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.72/0.82 % (23804)Termination reason: Unknown
% 0.72/0.82 % (23804)Termination phase: Saturation
% 0.72/0.82
% 0.72/0.82 % (23804)Memory used [KB]: 1867
% 0.72/0.82 % (23804)Time elapsed: 0.043 s
% 0.72/0.82 % (23804)Instructions burned: 83 (million)
% 0.72/0.82 % (23804)------------------------------
% 0.72/0.82 % (23804)------------------------------
% 0.72/0.82 % (23800)Instruction limit reached!
% 0.72/0.82 % (23800)------------------------------
% 0.72/0.82 % (23800)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.72/0.82 % (23800)Termination reason: Unknown
% 0.72/0.82 % (23800)Termination phase: Saturation
% 0.72/0.82
% 0.72/0.82 % (23800)Memory used [KB]: 1454
% 0.72/0.82 % (23800)Time elapsed: 0.044 s
% 0.72/0.82 % (23800)Instructions burned: 79 (million)
% 0.72/0.82 % (23800)------------------------------
% 0.72/0.82 % (23800)------------------------------
% 0.72/0.82 % (23807)Instruction limit reached!
% 0.72/0.82 % (23807)------------------------------
% 0.72/0.82 % (23807)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.72/0.82 % (23807)Termination reason: Unknown
% 0.72/0.82 % (23807)Termination phase: Saturation
% 0.72/0.82
% 0.72/0.82 % (23807)Memory used [KB]: 1274
% 0.72/0.82 % (23807)Time elapsed: 0.025 s
% 0.72/0.82 % (23807)Instructions burned: 51 (million)
% 0.72/0.82 % (23807)------------------------------
% 0.72/0.82 % (23807)------------------------------
% 0.72/0.83 % (23809)Instruction limit reached!
% 0.72/0.83 % (23809)------------------------------
% 0.72/0.83 % (23809)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.72/0.83 % (23809)Termination reason: Unknown
% 0.72/0.83 % (23809)Termination phase: Saturation
% 0.72/0.83
% 0.72/0.83 % (23809)Memory used [KB]: 1359
% 0.72/0.83 % (23809)Time elapsed: 0.025 s
% 0.72/0.83 % (23809)Instructions burned: 52 (million)
% 0.72/0.83 % (23809)------------------------------
% 0.72/0.83 % (23809)------------------------------
% 0.72/0.83 % (23813)lrs+1011_2:9_sil=2000:lsd=10:newcnf=on:i=117:sd=2:awrs=decay:ss=included:amm=off:ep=R_0 on theBenchmark for (2995ds/117Mi)
% 0.72/0.83 % (23814)dis+1011_11:1_sil=2000:avsq=on:i=143:avsqr=1,16:ep=RS:rawr=on:aac=none:lsd=100:mep=off:fde=none:newcnf=on:bsr=unit_only_0 on theBenchmark for (2995ds/143Mi)
% 0.72/0.83 % (23815)lrs+1011_1:2_to=lpo:sil=8000:plsqc=1:plsq=on:plsqr=326,59:sp=weighted_frequency:plsql=on:nwc=10.0:newcnf=on:i=93:awrs=converge:awrsf=200:bd=off:ins=1:rawr=on:alpa=false:avsq=on:avsqr=1,16_0 on theBenchmark for (2995ds/93Mi)
% 0.72/0.83 % (23816)lrs+1666_1:1_sil=4000:sp=occurrence:sos=on:urr=on:newcnf=on:i=62:amm=off:ep=R:erd=off:nm=0:plsq=on:plsqr=14,1_0 on theBenchmark for (2995ds/62Mi)
% 0.72/0.83 % (23810)First to succeed.
% 0.72/0.83 % (23810)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-23797"
% 0.72/0.83 % (23811)Instruction limit reached!
% 0.72/0.83 % (23811)------------------------------
% 0.72/0.83 % (23811)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.72/0.83 % (23811)Termination reason: Unknown
% 0.72/0.83 % (23811)Termination phase: Saturation
% 0.72/0.83
% 0.72/0.83 % (23811)Memory used [KB]: 1674
% 0.72/0.83 % (23811)Time elapsed: 0.023 s
% 0.72/0.83 % (23811)Instructions burned: 43 (million)
% 0.72/0.83 % (23811)------------------------------
% 0.72/0.83 % (23811)------------------------------
% 0.72/0.83 % (23810)Refutation found. Thanks to Tanya!
% 0.72/0.83 % SZS status Theorem for theBenchmark
% 0.72/0.83 % SZS output start Proof for theBenchmark
% See solution above
% 0.72/0.83 % (23810)------------------------------
% 0.72/0.83 % (23810)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.72/0.83 % (23810)Termination reason: Refutation
% 0.72/0.83
% 0.72/0.83 % (23810)Memory used [KB]: 1306
% 0.72/0.83 % (23810)Time elapsed: 0.031 s
% 0.72/0.83 % (23810)Instructions burned: 78 (million)
% 0.72/0.83 % (23797)Success in time 0.499 s
% 0.72/0.83 % Vampire---4.8 exiting
%------------------------------------------------------------------------------