TSTP Solution File: ARI612_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ARI612_1 : TPTP v8.1.2. 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 : n019.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 : Wed May 1 02:09:31 EDT 2024
% Result : Theorem 0.60s 0.81s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 37 ( 7 unt; 4 typ; 0 def)
% Number of atoms : 143 ( 0 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 163 ( 53 ~; 42 |; 49 &)
% ( 12 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number arithmetic : 178 ( 73 atm; 0 fun; 70 num; 35 var)
% Number of types : 2 ( 0 usr; 1 ari)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 1 usr; 5 con; 0-0 aty)
% Number of variables : 35 ( 29 !; 6 ?; 35 :)
% 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(pred_def_4,type,
sQ1_eqProxy: ( $int * $int ) > $o ).
tff(f64,plain,
$false,
inference(avatar_sat_refutation,[],[f49,f57,f63]) ).
tff(f63,plain,
spl2_2,
inference(avatar_contradiction_clause,[],[f62]) ).
tff(f62,plain,
( $false
| spl2_2 ),
inference(evaluation,[],[f60]) ).
tff(f60,plain,
( ~ $less(12,15)
| spl2_2 ),
inference(resolution,[],[f58,f37]) ).
tff(f37,plain,
$less(sK0,12),
inference(resolution,[],[f28,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/sandbox/tmp/tmp.cWmpjxJsGn/Vampire---4.8_32222',interv_8_12_subset_5_15) ).
tff(f28,plain,
! [X1: $int] :
( ~ q(X1)
| $less(X1,12) ),
inference(cnf_transformation,[],[f22]) ).
tff(f58,plain,
( ! [X0: $int] :
( ~ $less(X0,15)
| ~ $less(sK0,X0) )
| spl2_2 ),
inference(resolution,[],[f48,f9]) ).
tff(f9,plain,
! [X2: $int,X0: $int,X1: $int] :
( $less(X0,X2)
| ~ $less(X1,X2)
| ~ $less(X0,X1) ),
introduced(theory_axiom_143,[]) ).
tff(f48,plain,
( ~ $less(sK0,15)
| spl2_2 ),
inference(avatar_component_clause,[],[f46]) ).
tff(f46,plain,
( spl2_2
<=> $less(sK0,15) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
tff(f57,plain,
spl2_1,
inference(avatar_contradiction_clause,[],[f56]) ).
tff(f56,plain,
( $false
| spl2_1 ),
inference(evaluation,[],[f54]) ).
tff(f54,plain,
( ~ $less(5,8)
| spl2_1 ),
inference(resolution,[],[f52,f36]) ).
tff(f36,plain,
$less(8,sK0),
inference(resolution,[],[f27,f29]) ).
tff(f27,plain,
! [X1: $int] :
( ~ q(X1)
| $less(8,X1) ),
inference(cnf_transformation,[],[f22]) ).
tff(f52,plain,
( ! [X0: $int] :
( ~ $less(X0,sK0)
| ~ $less(5,X0) )
| spl2_1 ),
inference(resolution,[],[f44,f9]) ).
tff(f44,plain,
( ~ $less(5,sK0)
| spl2_1 ),
inference(avatar_component_clause,[],[f42]) ).
tff(f42,plain,
( spl2_1
<=> $less(5,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
tff(f49,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f38,f46,f42]) ).
tff(f38,plain,
( ~ $less(sK0,15)
| ~ $less(5,sK0) ),
inference(resolution,[],[f23,f30]) ).
tff(f30,plain,
~ p(sK0),
inference(cnf_transformation,[],[f22]) ).
tff(f23,plain,
! [X2: $int] :
( p(X2)
| ~ $less(X2,15)
| ~ $less(5,X2) ),
inference(cnf_transformation,[],[f22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : ARI612_1 : TPTP v8.1.2. Released v5.1.0.
% 0.03/0.12 % 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.12/0.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Apr 30 18:49:59 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.33 This is a TF0_THM_NEQ_ARI problem
% 0.12/0.33 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.cWmpjxJsGn/Vampire---4.8_32222
% 0.60/0.81 % (32331)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 (2995ds/34Mi)
% 0.60/0.81 % (32333)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.60/0.81 % (32337)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 (2995ds/83Mi)
% 0.60/0.81 % (32334)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.60/0.81 % (32332)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 (2995ds/51Mi)
% 0.60/0.81 % (32336)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.60/0.81 % (32338)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 (2995ds/56Mi)
% 0.60/0.81 % (32335)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 (2995ds/34Mi)
% 0.60/0.81 % (32338)First to succeed.
% 0.60/0.81 % (32335)Also succeeded, but the first one will report.
% 0.60/0.81 % (32338)Refutation found. Thanks to Tanya!
% 0.60/0.81 % SZS status Theorem for Vampire---4
% 0.60/0.81 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.81 % (32338)------------------------------
% 0.60/0.81 % (32338)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.81 % (32338)Termination reason: Refutation
% 0.60/0.81
% 0.60/0.81 % (32338)Memory used [KB]: 988
% 0.60/0.81 % (32338)Time elapsed: 0.004 s
% 0.60/0.81 % (32338)Instructions burned: 4 (million)
% 0.60/0.81 % (32338)------------------------------
% 0.60/0.81 % (32338)------------------------------
% 0.60/0.81 % (32330)Success in time 0.478 s
% 0.60/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------