TSTP Solution File: ARI612_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ARI612_1 : TPTP v8.2.0. Released v5.1.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 : n006.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 : Mon May 20 18:48:14 EDT 2024
% Result : Theorem 0.60s 0.76s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 29 ( 7 unt; 3 typ; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 70 ( 19 ~; 14 |; 19 &)
% ( 12 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number arithmetic : 94 ( 37 atm; 0 fun; 36 num; 21 var)
% Number of types : 2 ( 0 usr; 1 ari)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 1 usr; 5 con; 0-0 aty)
% Number of variables : 21 ( 19 !; 2 ?; 21 :)
% 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(f218,plain,
$false,
inference(avatar_sat_refutation,[],[f170,f176,f207]) ).
tff(f207,plain,
spl1_2,
inference(avatar_contradiction_clause,[],[f206]) ).
tff(f206,plain,
( $false
| spl1_2 ),
inference(evaluation,[],[f198]) ).
tff(f198,plain,
( ~ $less(5,8)
| spl1_2 ),
inference(unit_resulting_resolution,[],[f26,f169,f9]) ).
tff(f9,plain,
! [X2: $int,X0: $int,X1: $int] :
( ~ $less(X1,X2)
| ~ $less(X0,X1)
| $less(X0,X2) ),
introduced(theory_axiom_143,[]) ).
tff(f169,plain,
( ~ $less(5,sK0)
| spl1_2 ),
inference(avatar_component_clause,[],[f167]) ).
tff(f167,plain,
( spl1_2
<=> $less(5,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
tff(f26,plain,
$less(8,sK0),
inference(unit_resulting_resolution,[],[f24,f19]) ).
tff(f19,plain,
! [X0: $int] :
( ~ q(X0)
| $less(8,X0) ),
inference(cnf_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/sandbox/benchmark/theBenchmark.p',interv_8_12_subset_5_15) ).
tff(f24,plain,
q(sK0),
inference(cnf_transformation,[],[f17]) ).
tff(f176,plain,
spl1_1,
inference(avatar_contradiction_clause,[],[f175]) ).
tff(f175,plain,
( $false
| spl1_1 ),
inference(evaluation,[],[f172]) ).
tff(f172,plain,
( ~ $less(12,15)
| spl1_1 ),
inference(unit_resulting_resolution,[],[f35,f165,f9]) ).
tff(f165,plain,
( ~ $less(sK0,15)
| spl1_1 ),
inference(avatar_component_clause,[],[f163]) ).
tff(f163,plain,
( spl1_1
<=> $less(sK0,15) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).
tff(f35,plain,
$less(sK0,12),
inference(unit_resulting_resolution,[],[f24,f20]) ).
tff(f20,plain,
! [X0: $int] :
( ~ q(X0)
| $less(X0,12) ),
inference(cnf_transformation,[],[f17]) ).
tff(f170,plain,
( ~ spl1_1
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f161,f167,f163]) ).
tff(f161,plain,
( ~ $less(5,sK0)
| ~ $less(sK0,15) ),
inference(resolution,[],[f21,f25]) ).
tff(f25,plain,
~ p(sK0),
inference(cnf_transformation,[],[f17]) ).
tff(f21,plain,
! [X1: $int] :
( p(X1)
| ~ $less(5,X1)
| ~ $less(X1,15) ),
inference(cnf_transformation,[],[f17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : ARI612_1 : TPTP v8.2.0. Released v5.1.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.14/0.36 % Computer : n006.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 12:54:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TF0_THM_NEQ_ARI problem
% 0.14/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/benchmark/theBenchmark.p
% 0.60/0.75 % (30542)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 (2996ds/83Mi)
% 0.60/0.75 % (30536)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 (2996ds/34Mi)
% 0.60/0.75 % (30538)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.60/0.76 % (30537)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 (2996ds/51Mi)
% 0.60/0.76 % (30540)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 (2996ds/34Mi)
% 0.60/0.76 % (30539)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.60/0.76 % (30541)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.60/0.76 % (30542)First to succeed.
% 0.60/0.76 % (30542)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-30532"
% 0.60/0.76 % (30540)Also succeeded, but the first one will report.
% 0.60/0.76 % (30542)Refutation found. Thanks to Tanya!
% 0.60/0.76 % SZS status Theorem for theBenchmark
% 0.60/0.76 % SZS output start Proof for theBenchmark
% See solution above
% 0.60/0.76 % (30542)------------------------------
% 0.60/0.76 % (30542)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.76 % (30542)Termination reason: Refutation
% 0.60/0.76
% 0.60/0.76 % (30542)Memory used [KB]: 1070
% 0.60/0.76 % (30542)Time elapsed: 0.005 s
% 0.60/0.76 % (30542)Instructions burned: 9 (million)
% 0.60/0.76 % (30532)Success in time 0.39 s
% 0.60/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------