TSTP Solution File: SWV489+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV489+3 : TPTP v8.1.2. 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n018.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 : Sun May 5 10:35:00 EDT 2024
% Result : Theorem 0.60s 0.76s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 7
% Syntax : Number of formulae : 61 ( 12 unt; 0 def)
% Number of atoms : 329 ( 72 equ)
% Maximal formula atoms : 17 ( 5 avg)
% Number of connectives : 472 ( 204 ~; 180 |; 70 &)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 112 ( 102 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f241,plain,
$false,
inference(subsumption_resolution,[],[f240,f150]) ).
fof(f150,plain,
int_leq(sK1,sK0),
inference(resolution,[],[f147,f49]) ).
fof(f49,plain,
! [X0,X1] :
( int_less(X0,X1)
| int_leq(X1,X0) ),
inference(cnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( int_leq(X1,X0)
| int_less(X0,X1) ),
file('/export/starexec/sandbox/tmp/tmp.JVQDH3fACV/Vampire---4.8_31256',int_less_total) ).
fof(f147,plain,
~ int_less(sK0,sK1),
inference(subsumption_resolution,[],[f146,f39]) ).
fof(f39,plain,
int_leq(sK0,n),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
( real_zero != a(sK0,sK1)
& sK0 != sK1
& int_leq(sK1,n)
& int_leq(int_one,sK1)
& int_leq(sK0,n)
& int_leq(int_one,sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f20,f26]) ).
fof(f26,plain,
( ? [X0,X1] :
( real_zero != a(X0,X1)
& X0 != X1
& int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(X0,n)
& int_leq(int_one,X0) )
=> ( real_zero != a(sK0,sK1)
& sK0 != sK1
& int_leq(sK1,n)
& int_leq(int_one,sK1)
& int_leq(sK0,n)
& int_leq(int_one,sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
? [X0,X1] :
( real_zero != a(X0,X1)
& X0 != X1
& int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(X0,n)
& int_leq(int_one,X0) ),
inference(flattening,[],[f19]) ).
fof(f19,plain,
? [X0,X1] :
( real_zero != a(X0,X1)
& X0 != X1
& int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(X0,n)
& int_leq(int_one,X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] :
( ( X0 != X1
& int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(X0,n)
& int_leq(int_one,X0) )
=> real_zero = a(X0,X1) ),
inference(negated_conjecture,[],[f13]) ).
fof(f13,conjecture,
! [X0,X1] :
( ( X0 != X1
& int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(X0,n)
& int_leq(int_one,X0) )
=> real_zero = a(X0,X1) ),
file('/export/starexec/sandbox/tmp/tmp.JVQDH3fACV/Vampire---4.8_31256',d) ).
fof(f146,plain,
( ~ int_leq(sK0,n)
| ~ int_less(sK0,sK1) ),
inference(subsumption_resolution,[],[f145,f40]) ).
fof(f40,plain,
int_leq(int_one,sK1),
inference(cnf_transformation,[],[f27]) ).
fof(f145,plain,
( ~ int_leq(int_one,sK1)
| ~ int_leq(sK0,n)
| ~ int_less(sK0,sK1) ),
inference(subsumption_resolution,[],[f144,f41]) ).
fof(f41,plain,
int_leq(sK1,n),
inference(cnf_transformation,[],[f27]) ).
fof(f144,plain,
( ~ int_leq(sK1,n)
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK0,n)
| ~ int_less(sK0,sK1) ),
inference(subsumption_resolution,[],[f140,f38]) ).
fof(f38,plain,
int_leq(int_one,sK0),
inference(cnf_transformation,[],[f27]) ).
fof(f140,plain,
( ~ int_leq(int_one,sK0)
| ~ int_leq(sK1,n)
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK0,n)
| ~ int_less(sK0,sK1) ),
inference(trivial_inequality_removal,[],[f130]) ).
fof(f130,plain,
( real_zero != real_zero
| ~ int_leq(int_one,sK0)
| ~ int_leq(sK1,n)
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK0,n)
| ~ int_less(sK0,sK1) ),
inference(superposition,[],[f43,f126]) ).
fof(f126,plain,
! [X0,X1] :
( real_zero = a(X0,X1)
| ~ int_leq(int_one,X0)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_less(X0,X1) ),
inference(subsumption_resolution,[],[f125,f64]) ).
fof(f64,plain,
! [X1] : int_leq(X1,X1),
inference(equality_resolution,[],[f52]) ).
fof(f52,plain,
! [X0,X1] :
( int_leq(X0,X1)
| 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/sandbox/tmp/tmp.JVQDH3fACV/Vampire---4.8_31256',int_leq) ).
fof(f125,plain,
! [X0,X1] :
( ~ int_leq(X1,n)
| ~ int_leq(X0,X0)
| ~ int_leq(int_one,X0)
| real_zero = a(X0,X1)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_less(X0,X1) ),
inference(duplicate_literal_removal,[],[f122]) ).
fof(f122,plain,
! [X0,X1] :
( ~ int_leq(X1,n)
| ~ int_leq(X0,X0)
| ~ int_leq(int_one,X0)
| real_zero = a(X0,X1)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0)
| ~ int_less(X0,X1)
| ~ int_less(X0,X1) ),
inference(superposition,[],[f100,f45]) ).
fof(f45,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/sandbox/tmp/tmp.JVQDH3fACV/Vampire---4.8_31256',plus_and_inverse) ).
fof(f100,plain,
! [X2,X0,X1] :
( ~ int_leq(plus(X2,sK2(X0,X1)),n)
| ~ int_leq(X0,X2)
| ~ int_leq(int_one,X0)
| real_zero = a(X0,X1)
| ~ int_leq(int_one,plus(X2,sK2(X0,X1)))
| ~ int_leq(X2,n)
| ~ int_leq(int_one,X2)
| ~ int_less(X0,X1) ),
inference(subsumption_resolution,[],[f96,f46]) ).
fof(f46,plain,
! [X0,X1] :
( int_less(int_zero,sK2(X0,X1))
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f96,plain,
! [X2,X0,X1] :
( real_zero = a(X0,X1)
| ~ int_leq(X0,X2)
| ~ int_leq(int_one,X0)
| ~ int_less(int_zero,sK2(X0,X1))
| ~ int_leq(plus(X2,sK2(X0,X1)),n)
| ~ int_leq(int_one,plus(X2,sK2(X0,X1)))
| ~ int_leq(X2,n)
| ~ int_leq(int_one,X2)
| ~ int_less(X0,X1) ),
inference(superposition,[],[f60,f45]) ).
fof(f60,plain,
! [X2,X3,X0] :
( real_zero = a(X3,plus(X3,X2))
| ~ int_leq(X3,X0)
| ~ int_leq(int_one,X3)
| ~ int_less(int_zero,X2)
| ~ int_leq(plus(X0,X2),n)
| ~ int_leq(int_one,plus(X0,X2))
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) ),
inference(equality_resolution,[],[f37]) ).
fof(f37,plain,
! [X2,X3,X0,X1] :
( real_zero = a(X3,plus(X3,X2))
| ~ int_leq(X3,X0)
| ~ int_leq(int_one,X3)
| plus(X0,X2) != X1
| ~ int_less(int_zero,X2)
| ~ 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] :
( real_zero = a(X3,plus(X3,X2))
| ~ int_leq(X3,X0)
| ~ int_leq(int_one,X3) )
| plus(X0,X2) != X1
| ~ int_less(int_zero,X2) )
& ! [X4] :
( real_one = a(X4,X4)
| ~ int_leq(X4,X1)
| ~ int_leq(int_one,X4) )
& ! [X5] :
( ! [X6] :
( real_zero = a(plus(X6,X5),X6)
| ~ int_leq(X6,X1)
| ~ int_leq(int_one,X6) )
| plus(X1,X5) != X0
| ~ int_less(int_zero,X5) ) )
| ~ 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] :
( real_zero = a(X3,plus(X3,X2))
| ~ int_leq(X3,X0)
| ~ int_leq(int_one,X3) )
| plus(X0,X2) != X1
| ~ int_less(int_zero,X2) )
& ! [X4] :
( real_one = a(X4,X4)
| ~ int_leq(X4,X1)
| ~ int_leq(int_one,X4) )
& ! [X5] :
( ! [X6] :
( real_zero = a(plus(X6,X5),X6)
| ~ int_leq(X6,X1)
| ~ int_leq(int_one,X6) )
| plus(X1,X5) != X0
| ~ int_less(int_zero,X5) ) )
| ~ 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_less(int_zero,X2) )
=> ! [X3] :
( ( int_leq(X3,X0)
& int_leq(int_one,X3) )
=> real_zero = a(X3,plus(X3,X2)) ) )
& ! [X4] :
( ( int_leq(X4,X1)
& int_leq(int_one,X4) )
=> real_one = a(X4,X4) )
& ! [X5] :
( ( plus(X1,X5) = X0
& int_less(int_zero,X5) )
=> ! [X6] :
( ( int_leq(X6,X1)
& int_leq(int_one,X6) )
=> real_zero = a(plus(X6,X5),X6) ) ) ) ),
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_less(int_zero,X7) )
=> ! [X2] :
( ( int_leq(X2,X0)
& int_leq(int_one,X2) )
=> real_zero = a(X2,plus(X2,X7)) ) )
& ! [X2] :
( ( int_leq(X2,X1)
& int_leq(int_one,X2) )
=> real_one = a(X2,X2) )
& ! [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/sandbox/tmp/tmp.JVQDH3fACV/Vampire---4.8_31256',qii) ).
fof(f43,plain,
real_zero != a(sK0,sK1),
inference(cnf_transformation,[],[f27]) ).
fof(f240,plain,
~ int_leq(sK1,sK0),
inference(subsumption_resolution,[],[f238,f42]) ).
fof(f42,plain,
sK0 != sK1,
inference(cnf_transformation,[],[f27]) ).
fof(f238,plain,
( sK0 = sK1
| ~ int_leq(sK1,sK0) ),
inference(resolution,[],[f236,f50]) ).
fof(f50,plain,
! [X0,X1] :
( int_less(X0,X1)
| X0 = X1
| ~ int_leq(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f236,plain,
~ int_less(sK1,sK0),
inference(subsumption_resolution,[],[f235,f38]) ).
fof(f235,plain,
( ~ int_leq(int_one,sK0)
| ~ int_less(sK1,sK0) ),
inference(subsumption_resolution,[],[f234,f39]) ).
fof(f234,plain,
( ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK0)
| ~ int_less(sK1,sK0) ),
inference(subsumption_resolution,[],[f233,f41]) ).
fof(f233,plain,
( ~ int_leq(sK1,n)
| ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK0)
| ~ int_less(sK1,sK0) ),
inference(subsumption_resolution,[],[f229,f40]) ).
fof(f229,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,[],[f219]) ).
fof(f219,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,[],[f43,f156]) ).
fof(f156,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,[],[f155,f64]) ).
fof(f155,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,[],[f152]) ).
fof(f152,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,[],[f105,f45]) ).
fof(f105,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,[],[f101,f46]) ).
fof(f101,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,[],[f61,f45]) ).
fof(f61,plain,
! [X1,X6,X5] :
( real_zero = a(plus(X6,X5),X6)
| ~ int_leq(X6,X1)
| ~ int_leq(int_one,X6)
| ~ int_less(int_zero,X5)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(plus(X1,X5),n)
| ~ int_leq(int_one,plus(X1,X5)) ),
inference(equality_resolution,[],[f35]) ).
fof(f35,plain,
! [X0,X1,X6,X5] :
( real_zero = a(plus(X6,X5),X6)
| ~ int_leq(X6,X1)
| ~ int_leq(int_one,X6)
| plus(X1,X5) != X0
| ~ int_less(int_zero,X5)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV489+3 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 21:08:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.JVQDH3fACV/Vampire---4.8_31256
% 0.59/0.75 % (31372)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.59/0.75 % (31365)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 Vampire---4 for (2996ds/34Mi)
% 0.59/0.75 % (31368)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.59/0.75 % (31367)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.59/0.75 % (31366)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 Vampire---4 for (2996ds/51Mi)
% 0.59/0.75 % (31370)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.59/0.75 % (31369)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 Vampire---4 for (2996ds/34Mi)
% 0.59/0.75 % (31372)Refutation not found, incomplete strategy% (31372)------------------------------
% 0.59/0.75 % (31372)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.75 % (31372)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.75
% 0.59/0.75 % (31372)Memory used [KB]: 1044
% 0.59/0.75 % (31372)Time elapsed: 0.002 s
% 0.59/0.75 % (31372)Instructions burned: 3 (million)
% 0.59/0.75 % (31371)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 Vampire---4 for (2996ds/83Mi)
% 0.59/0.75 % (31372)------------------------------
% 0.59/0.75 % (31372)------------------------------
% 0.59/0.75 % (31369)Refutation not found, incomplete strategy% (31369)------------------------------
% 0.59/0.75 % (31369)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.75 % (31369)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.75
% 0.59/0.75 % (31369)Memory used [KB]: 1047
% 0.59/0.75 % (31369)Time elapsed: 0.004 s
% 0.59/0.75 % (31369)Instructions burned: 4 (million)
% 0.59/0.75 % (31369)------------------------------
% 0.59/0.75 % (31369)------------------------------
% 0.59/0.75 % (31373)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 Vampire---4 for (2996ds/55Mi)
% 0.59/0.76 % (31370)First to succeed.
% 0.59/0.76 % (31374)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 Vampire---4 for (2996ds/50Mi)
% 0.60/0.76 % (31370)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-31363"
% 0.60/0.76 % (31370)Refutation found. Thanks to Tanya!
% 0.60/0.76 % SZS status Theorem for Vampire---4
% 0.60/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.76 % (31370)------------------------------
% 0.60/0.76 % (31370)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.76 % (31370)Termination reason: Refutation
% 0.60/0.76
% 0.60/0.76 % (31370)Memory used [KB]: 1091
% 0.60/0.76 % (31370)Time elapsed: 0.010 s
% 0.60/0.76 % (31370)Instructions burned: 14 (million)
% 0.60/0.76 % (31363)Success in time 0.396 s
% 0.60/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------