TSTP Solution File: ARI612_1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : ARI612_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 : 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 Apr 30 10:35:42 EDT 2024
% Result : Theorem 0.13s 0.38s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 10
% Syntax : Number of formulae : 45 ( 19 unt; 3 typ; 0 def)
% Number of atoms : 148 ( 5 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 154 ( 48 ~; 40 |; 49 &)
% ( 10 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 231 ( 88 atm; 10 fun; 87 num; 46 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 : 9 ( 1 usr; 8 con; 0-2 aty)
% Number of variables : 46 ( 40 !; 6 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_8,type,
sK0: $int ).
tff(pred_def_1,type,
p: $int > $o ).
tff(pred_def_2,type,
q: $int > $o ).
tff(f180,plain,
$false,
inference(evaluation,[],[f166]) ).
tff(f166,plain,
$less(8,$sum(1,5)),
inference(backward_demodulation,[],[f80,f159]) ).
tff(f159,plain,
5 = sK0,
inference(evaluation,[],[f157]) ).
tff(f157,plain,
( ( 5 = sK0 )
| $less(8,5) ),
inference(resolution,[],[f136,f74]) ).
tff(f74,plain,
! [X0: $int] :
( ~ $less(sK0,X0)
| $less(8,X0) ),
inference(resolution,[],[f9,f31]) ).
tff(f31,plain,
$less(8,sK0),
inference(resolution,[],[f27,f29]) ).
tff(f29,plain,
q(sK0),
inference(cnf_transformation,[],[f22]) ).
tff(f22,plain,
( ~ p(sK0)
& q(sK0)
& ! [X1: $int] :
( ( ( $less(X1,12)
& $less(8,X1) )
| ~ q(X1) )
& ( q(X1)
| ~ $less(X1,12)
| ~ $less(8,X1) ) )
& ! [X2: $int] :
( ( ( $less(X2,15)
& $less(5,X2) )
| ~ p(X2) )
& ( p(X2)
| ~ $less(X2,15)
| ~ $less(5,X2) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f20,f21]) ).
tff(f21,plain,
( ? [X0: $int] :
( ~ p(X0)
& q(X0) )
=> ( ~ p(sK0)
& q(sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f20,plain,
( ? [X0: $int] :
( ~ p(X0)
& q(X0) )
& ! [X1: $int] :
( ( ( $less(X1,12)
& $less(8,X1) )
| ~ q(X1) )
& ( q(X1)
| ~ $less(X1,12)
| ~ $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] :
( ~ p(X2)
& q(X2) )
& ! [X0: $int] :
( ( ( $less(X0,12)
& $less(8,X0) )
| ~ q(X0) )
& ( q(X0)
| ~ $less(X0,12)
| ~ $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] :
( ~ p(X2)
& q(X2) )
& ! [X0: $int] :
( ( ( $less(X0,12)
& $less(8,X0) )
| ~ q(X0) )
& ( q(X0)
| ~ $less(X0,12)
| ~ $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] :
( ~ p(X2)
& q(X2) )
& ! [X0: $int] :
( ( $less(X0,12)
& $less(8,X0) )
<=> q(X0) )
& ! [X1: $int] :
( ( $less(X1,15)
& $less(5,X1) )
<=> p(X1) ) ),
inference(flattening,[],[f16]) ).
tff(f16,plain,
( ? [X2: $int] :
( ~ p(X2)
& q(X2) )
& ! [X0: $int] :
( ( $less(X0,12)
& $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,12)
& $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,12)
& $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,12)
& $less(8,X0) )
<=> q(X0) )
& ! [X0: $int] :
( ( $less(X0,15)
& $less(5,X0) )
<=> p(X0) ) )
=> ! [X0: $int] :
( q(X0)
=> p(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',interv_8_12_subset_5_15) ).
tff(f27,plain,
! [X1: $int] :
( ~ q(X1)
| $less(8,X1) ),
inference(cnf_transformation,[],[f22]) ).
tff(f9,plain,
! [X2: $int,X0: $int,X1: $int] :
( ~ $less(X0,X1)
| ~ $less(X1,X2)
| $less(X0,X2) ),
introduced(theory_axiom_143,[]) ).
tff(f136,plain,
( $less(sK0,5)
| ( 5 = sK0 ) ),
inference(resolution,[],[f10,f121]) ).
tff(f121,plain,
~ $less(5,sK0),
inference(subsumption_resolution,[],[f119,f30]) ).
tff(f30,plain,
~ p(sK0),
inference(cnf_transformation,[],[f22]) ).
tff(f119,plain,
( p(sK0)
| ~ $less(5,sK0) ),
inference(resolution,[],[f115,f23]) ).
tff(f23,plain,
! [X2: $int] :
( ~ $less(X2,15)
| p(X2)
| ~ $less(5,X2) ),
inference(cnf_transformation,[],[f22]) ).
tff(f115,plain,
$less(sK0,15),
inference(evaluation,[],[f113]) ).
tff(f113,plain,
$less(sK0,$sum(1,14)),
inference(resolution,[],[f110,f51]) ).
tff(f51,plain,
! [X0: $int] : $less(X0,$sum(1,X0)),
inference(superposition,[],[f46,f3]) ).
tff(f3,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(theory_axiom_135,[]) ).
tff(f46,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(f110,plain,
! [X0: $int] :
( ~ $less(14,X0)
| $less(sK0,X0) ),
inference(resolution,[],[f106,f9]) ).
tff(f106,plain,
$less(sK0,14),
inference(evaluation,[],[f104]) ).
tff(f104,plain,
$less(sK0,$sum(1,13)),
inference(resolution,[],[f93,f51]) ).
tff(f93,plain,
! [X0: $int] :
( ~ $less(13,X0)
| $less(sK0,X0) ),
inference(resolution,[],[f90,f9]) ).
tff(f90,plain,
$less(sK0,13),
inference(evaluation,[],[f88]) ).
tff(f88,plain,
$less(sK0,$sum(1,12)),
inference(resolution,[],[f75,f51]) ).
tff(f75,plain,
! [X0: $int] :
( ~ $less(12,X0)
| $less(sK0,X0) ),
inference(resolution,[],[f9,f32]) ).
tff(f32,plain,
$less(sK0,12),
inference(resolution,[],[f28,f29]) ).
tff(f28,plain,
! [X1: $int] :
( ~ q(X1)
| $less(X1,12) ),
inference(cnf_transformation,[],[f22]) ).
tff(f10,plain,
! [X0: $int,X1: $int] :
( $less(X0,X1)
| $less(X1,X0)
| ( X0 = X1 ) ),
introduced(theory_axiom_144,[]) ).
tff(f80,plain,
$less(8,$sum(1,sK0)),
inference(resolution,[],[f74,f51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ARI612_1 : TPTP v8.1.2. Released v5.1.0.
% 0.11/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.35 % Computer : n025.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 : Tue Apr 30 05:44:26 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % (5122)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.37 % (5128)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.13/0.37 % (5127)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.13/0.37 % (5126)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.13/0.37 % (5124)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.13/0.37 % (5125)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.13/0.37 % (5129)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.13/0.37 % (5124)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.13/0.37 % (5124)Terminated due to inappropriate strategy.
% 0.13/0.37 % (5124)------------------------------
% 0.13/0.37 % (5124)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.13/0.37 % (5126)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.13/0.37 % (5124)Termination reason: Inappropriate
% 0.13/0.37
% 0.13/0.37 % (5124)Memory used [KB]: 721
% 0.13/0.37 % (5124)Time elapsed: 0.002 s
% 0.13/0.37 % (5124)Instructions burned: 2 (million)
% 0.13/0.37 % (5124)------------------------------
% 0.13/0.37 % (5124)------------------------------
% 0.13/0.37 % (5126)Terminated due to inappropriate strategy.
% 0.13/0.37 % (5126)------------------------------
% 0.13/0.37 % (5126)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.13/0.37 % (5126)Termination reason: Inappropriate
% 0.13/0.37
% 0.13/0.37 % (5126)Memory used [KB]: 721
% 0.13/0.37 % (5126)Time elapsed: 0.003 s
% 0.13/0.37 % (5126)Instructions burned: 2 (million)
% 0.13/0.37 % (5126)------------------------------
% 0.13/0.37 % (5126)------------------------------
% 0.13/0.37 % (5129)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.13/0.37 % (5129)Terminated due to inappropriate strategy.
% 0.13/0.37 % (5129)------------------------------
% 0.13/0.37 % (5129)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.13/0.37 % (5129)Termination reason: Inappropriate
% 0.13/0.37
% 0.13/0.37 % (5129)Memory used [KB]: 720
% 0.13/0.37 % (5129)Time elapsed: 0.002 s
% 0.13/0.37 % (5129)Instructions burned: 2 (million)
% 0.13/0.37 % (5129)------------------------------
% 0.13/0.37 % (5129)------------------------------
% 0.13/0.37 % (5123)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.13/0.38 % (5123)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.13/0.38 % (5123)Terminated due to inappropriate strategy.
% 0.13/0.38 % (5123)------------------------------
% 0.13/0.38 % (5123)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.13/0.38 % (5123)Termination reason: Inappropriate
% 0.13/0.38
% 0.13/0.38 % (5123)Memory used [KB]: 719
% 0.13/0.38 % (5123)Time elapsed: 0.003 s
% 0.13/0.38 % (5123)Instructions burned: 2 (million)
% 0.13/0.38 % (5123)------------------------------
% 0.13/0.38 % (5123)------------------------------
% 0.13/0.38 % (5127)First to succeed.
% 0.13/0.38 % (5127)Refutation found. Thanks to Tanya!
% 0.13/0.38 % SZS status Theorem for theBenchmark
% 0.13/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.38 % (5127)------------------------------
% 0.13/0.38 % (5127)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.13/0.38 % (5127)Termination reason: Refutation
% 0.13/0.38
% 0.13/0.38 % (5127)Memory used [KB]: 843
% 0.13/0.38 % (5127)Time elapsed: 0.007 s
% 0.13/0.38 % (5127)Instructions burned: 9 (million)
% 0.13/0.38 % (5127)------------------------------
% 0.13/0.38 % (5127)------------------------------
% 0.13/0.38 % (5122)Success in time 0.018 s
%------------------------------------------------------------------------------