TSTP Solution File: ARI611_1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : ARI611_1 : TPTP v8.1.2. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n010.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 04:36:26 EDT 2024
% Result : Theorem 0.12s 0.37s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 5 unt; 2 typ; 0 def)
% Number of atoms : 109 ( 3 equ)
% Maximal formula atoms : 14 ( 5 avg)
% Number of connectives : 129 ( 41 ~; 37 |; 38 &)
% ( 10 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 163 ( 59 atm; 4 fun; 66 num; 34 var)
% Number of types : 2 ( 0 usr; 1 ari)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 0 usr; 6 con; 0-2 aty)
% Number of variables : 34 ( 31 !; 3 ?; 34 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_1,type,
p: $int > $o ).
tff(pred_def_2,type,
q: $int > $o ).
tff(f427,plain,
$false,
inference(evaluation,[],[f426]) ).
tff(f426,plain,
( ( 5 = 9 )
| ~ $less(9,15)
| $less(9,5) ),
inference(resolution,[],[f64,f60]) ).
tff(f60,plain,
~ p(9),
inference(resolution,[],[f54,f27]) ).
tff(f27,plain,
! [X0: $int] :
( ~ q(X0)
| ~ p(X0) ),
inference(cnf_transformation,[],[f20]) ).
tff(f20,plain,
( ! [X0: $int] :
( ~ q(X0)
| ~ p(X0) )
& ! [X1: $int] :
( ( ( $less(X1,18)
& $less(8,X1) )
| ~ q(X1) )
& ( q(X1)
| ~ $less(X1,18)
| ~ $less(8,X1) ) )
& ! [X2: $int] :
( ( ( $less(X2,15)
& $less(5,X2) )
| ~ p(X2) )
& ( p(X2)
| ~ $less(X2,15)
| ~ $less(5,X2) ) ) ),
inference(rectify,[],[f19]) ).
tff(f19,plain,
( ! [X2: $int] :
( ~ q(X2)
| ~ p(X2) )
& ! [X0: $int] :
( ( ( $less(X0,18)
& $less(8,X0) )
| ~ q(X0) )
& ( q(X0)
| ~ $less(X0,18)
| ~ $less(8,X0) ) )
& ! [X1: $int] :
( ( ( $less(X1,15)
& $less(5,X1) )
| ~ p(X1) )
& ( p(X1)
| ~ $less(X1,15)
| ~ $less(5,X1) ) ) ),
inference(flattening,[],[f18]) ).
tff(f18,plain,
( ! [X2: $int] :
( ~ q(X2)
| ~ p(X2) )
& ! [X0: $int] :
( ( ( $less(X0,18)
& $less(8,X0) )
| ~ q(X0) )
& ( q(X0)
| ~ $less(X0,18)
| ~ $less(8,X0) ) )
& ! [X1: $int] :
( ( ( $less(X1,15)
& $less(5,X1) )
| ~ p(X1) )
& ( p(X1)
| ~ $less(X1,15)
| ~ $less(5,X1) ) ) ),
inference(nnf_transformation,[],[f17]) ).
tff(f17,plain,
( ! [X2: $int] :
( ~ q(X2)
| ~ p(X2) )
& ! [X0: $int] :
( ( $less(X0,18)
& $less(8,X0) )
<=> q(X0) )
& ! [X1: $int] :
( ( $less(X1,15)
& $less(5,X1) )
<=> p(X1) ) ),
inference(flattening,[],[f16]) ).
tff(f16,plain,
( ! [X2: $int] :
( ~ q(X2)
| ~ p(X2) )
& ! [X0: $int] :
( ( $less(X0,18)
& $less(8,X0) )
<=> q(X0) )
& ! [X1: $int] :
( ( $less(X1,15)
& $less(5,X1) )
<=> p(X1) ) ),
inference(ennf_transformation,[],[f15]) ).
tff(f15,plain,
~ ( ( ! [X0: $int] :
( ( $less(X0,18)
& $less(8,X0) )
<=> q(X0) )
& ! [X1: $int] :
( ( $less(X1,15)
& $less(5,X1) )
<=> p(X1) ) )
=> ? [X2: $int] :
( q(X2)
& p(X2) ) ),
inference(rectify,[],[f2]) ).
tff(f2,negated_conjecture,
~ ( ( ! [X0: $int] :
( ( $less(X0,18)
& $less(8,X0) )
<=> q(X0) )
& ! [X0: $int] :
( ( $less(X0,15)
& $less(5,X0) )
<=> p(X0) ) )
=> ? [X0: $int] :
( q(X0)
& p(X0) ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
( ( ! [X0: $int] :
( ( $less(X0,18)
& $less(8,X0) )
<=> q(X0) )
& ! [X0: $int] :
( ( $less(X0,15)
& $less(5,X0) )
<=> p(X0) ) )
=> ? [X0: $int] :
( q(X0)
& p(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',interv_5_15_and_8_18_intersect) ).
tff(f54,plain,
q(9),
inference(evaluation,[],[f49]) ).
tff(f49,plain,
( ~ $less($sum(8,1),18)
| q($sum(8,1)) ),
inference(resolution,[],[f40,f24]) ).
tff(f24,plain,
! [X1: $int] :
( ~ $less(8,X1)
| ~ $less(X1,18)
| q(X1) ),
inference(cnf_transformation,[],[f20]) ).
tff(f40,plain,
! [X0: $int] : $less(X0,$sum(X0,1)),
inference(resolution,[],[f12,f8]) ).
tff(f8,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(theory_axiom_142,[]) ).
tff(f12,plain,
! [X0: $int,X1: $int] :
( $less(X1,$sum(X0,1))
| $less(X0,X1) ),
introduced(theory_axiom_147,[]) ).
tff(f64,plain,
! [X0: $int] :
( p(X0)
| ( 5 = X0 )
| ~ $less(X0,15)
| $less(X0,5) ),
inference(resolution,[],[f10,f21]) ).
tff(f21,plain,
! [X2: $int] :
( ~ $less(5,X2)
| ~ $less(X2,15)
| p(X2) ),
inference(cnf_transformation,[],[f20]) ).
tff(f10,plain,
! [X0: $int,X1: $int] :
( $less(X0,X1)
| $less(X1,X0)
| ( X0 = X1 ) ),
introduced(theory_axiom_144,[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : ARI611_1 : TPTP v8.1.2. Released v5.1.0.
% 0.06/0.12 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.12/0.34 % Computer : n010.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri May 3 21:44:08 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % (23295)Running in auto input_syntax mode. Trying TPTP
% 0.12/0.35 % (23299)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.12/0.35 % (23297)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.12/0.36 % (23301)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.12/0.36 % (23297)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.12/0.36 % (23299)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.12/0.36 % (23299)Terminated due to inappropriate strategy.
% 0.12/0.36 % (23299)------------------------------
% 0.12/0.36 % (23299)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.12/0.36 % (23297)Terminated due to inappropriate strategy.
% 0.12/0.36 % (23297)------------------------------
% 0.12/0.36 % (23297)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.12/0.36 % (23297)Termination reason: Inappropriate
% 0.12/0.36
% 0.12/0.36 % (23297)Memory used [KB]: 719
% 0.12/0.36 % (23297)Time elapsed: 0.002 s
% 0.12/0.36 % (23297)Instructions burned: 2 (million)
% 0.12/0.36 % (23299)Termination reason: Inappropriate
% 0.12/0.36
% 0.12/0.36 % (23299)Memory used [KB]: 719
% 0.12/0.36 % (23299)Time elapsed: 0.003 s
% 0.12/0.36 % (23299)Instructions burned: 2 (million)
% 0.12/0.36 % (23300)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.12/0.36 % (23297)------------------------------
% 0.12/0.36 % (23297)------------------------------
% 0.12/0.36 % (23299)------------------------------
% 0.12/0.36 % (23299)------------------------------
% 0.12/0.36 % (23298)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.12/0.36 % (23302)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.12/0.36 % (23302)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.12/0.36 % (23302)Terminated due to inappropriate strategy.
% 0.12/0.36 % (23302)------------------------------
% 0.12/0.36 % (23302)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.12/0.36 % (23302)Termination reason: Inappropriate
% 0.12/0.36
% 0.12/0.36 % (23302)Memory used [KB]: 719
% 0.12/0.36 % (23302)Time elapsed: 0.002 s
% 0.12/0.36 % (23302)Instructions burned: 2 (million)
% 0.12/0.36 % (23302)------------------------------
% 0.12/0.36 % (23302)------------------------------
% 0.12/0.36 % (23296)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.12/0.36 % (23296)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.12/0.36 % (23296)Terminated due to inappropriate strategy.
% 0.12/0.36 % (23296)------------------------------
% 0.12/0.36 % (23296)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.12/0.36 % (23296)Termination reason: Inappropriate
% 0.12/0.36
% 0.12/0.36 % (23296)Memory used [KB]: 718
% 0.12/0.36 % (23296)Time elapsed: 0.003 s
% 0.12/0.36 % (23296)Instructions burned: 2 (million)
% 0.12/0.36 % (23296)------------------------------
% 0.12/0.36 % (23296)------------------------------
% 0.12/0.37 % (23301)First to succeed.
% 0.12/0.37 % (23301)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-23295"
% 0.12/0.37 % (23301)Refutation found. Thanks to Tanya!
% 0.12/0.37 % SZS status Theorem for theBenchmark
% 0.12/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.37 % (23301)------------------------------
% 0.12/0.37 % (23301)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.12/0.37 % (23301)Termination reason: Refutation
% 0.12/0.37
% 0.12/0.37 % (23301)Memory used [KB]: 878
% 0.12/0.37 % (23301)Time elapsed: 0.013 s
% 0.12/0.37 % (23301)Instructions burned: 21 (million)
% 0.12/0.37 % (23295)Success in time 0.025 s
%------------------------------------------------------------------------------