TSTP Solution File: ARI613_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ARI613_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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n027.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.58s 0.74s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 21 ( 9 unt; 2 typ; 0 def)
% Number of atoms : 60 ( 8 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 67 ( 26 ~; 17 |; 15 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 96 ( 19 atm; 13 fun; 31 num; 33 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; 5 con; 0-2 aty)
% Number of variables : 33 ( 27 !; 6 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_1,type,
p: $int > $o ).
tff(pred_def_2,type,
q: $int > $o ).
tff(f43,plain,
$false,
inference(evaluation,[],[f42]) ).
tff(f42,plain,
~ $less(-4,1),
inference(unit_resulting_resolution,[],[f35,f20]) ).
tff(f20,plain,
! [X2: $int] :
( ~ $less(X2,1)
| q(X2) ),
inference(cnf_transformation,[],[f18]) ).
tff(f18,plain,
( ! [X0: $int,X1: $int] :
( ( $sum(X0,X1) != 0 )
| ~ q(X1)
| ~ p(X0) )
& ! [X2: $int] :
( q(X2)
| ~ $less(X2,1) )
& ! [X3: $int] :
( p(X3)
| ~ $less(3,X3) ) ),
inference(rectify,[],[f17]) ).
tff(f17,plain,
( ! [X2: $int,X3: $int] :
( ( 0 != $sum(X2,X3) )
| ~ q(X3)
| ~ p(X2) )
& ! [X0: $int] :
( q(X0)
| ~ $less(X0,1) )
& ! [X1: $int] :
( p(X1)
| ~ $less(3,X1) ) ),
inference(flattening,[],[f16]) ).
tff(f16,plain,
( ! [X2: $int,X3: $int] :
( ( 0 != $sum(X2,X3) )
| ~ q(X3)
| ~ p(X2) )
& ! [X0: $int] :
( q(X0)
| ~ $less(X0,1) )
& ! [X1: $int] :
( p(X1)
| ~ $less(3,X1) ) ),
inference(ennf_transformation,[],[f15]) ).
tff(f15,plain,
~ ( ( ! [X0: $int] :
( $less(X0,1)
=> q(X0) )
& ! [X1: $int] :
( $less(3,X1)
=> p(X1) ) )
=> ? [X2: $int,X3: $int] :
( ( 0 = $sum(X2,X3) )
& q(X3)
& p(X2) ) ),
inference(rectify,[],[f2]) ).
tff(f2,negated_conjecture,
~ ( ( ! [X0: $int] :
( $less(X0,1)
=> q(X0) )
& ! [X0: $int] :
( $less(3,X0)
=> p(X0) ) )
=> ? [X0: $int,X1: $int] :
( ( $sum(X0,X1) = 0 )
& q(X1)
& p(X0) ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
( ( ! [X0: $int] :
( $less(X0,1)
=> q(X0) )
& ! [X0: $int] :
( $less(3,X0)
=> p(X0) ) )
=> ? [X0: $int,X1: $int] :
( ( $sum(X0,X1) = 0 )
& q(X1)
& p(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',interv_3_infty_and_neginfty_1_contain_compl) ).
tff(f35,plain,
~ q(-4),
inference(evaluation,[],[f34]) ).
tff(f34,plain,
~ q($uminus(4)),
inference(unit_resulting_resolution,[],[f7,f33,f21]) ).
tff(f21,plain,
! [X0: $int,X1: $int] :
( ( $sum(X0,X1) != 0 )
| ~ q(X1)
| ~ p(X0) ),
inference(cnf_transformation,[],[f18]) ).
tff(f33,plain,
p(4),
inference(evaluation,[],[f27]) ).
tff(f27,plain,
p($sum(3,1)),
inference(unit_resulting_resolution,[],[f23,f19]) ).
tff(f19,plain,
! [X3: $int] :
( ~ $less(3,X3)
| p(X3) ),
inference(cnf_transformation,[],[f18]) ).
tff(f23,plain,
! [X0: $int] : $less(X0,$sum(X0,1)),
inference(unit_resulting_resolution,[],[f8,f12]) ).
tff(f12,plain,
! [X0: $int,X1: $int] :
( $less(X1,$sum(X0,1))
| $less(X0,X1) ),
introduced(theory_axiom_147,[]) ).
tff(f8,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(theory_axiom_142,[]) ).
tff(f7,plain,
! [X0: $int] : ( 0 = $sum(X0,$uminus(X0)) ),
introduced(theory_axiom_140,[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ARI613_1 : TPTP v8.2.0. Released v5.1.0.
% 0.06/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 12:46:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TF0_THM_EQU_ARI problem
% 0.14/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.53/0.74 % (9294)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.53/0.74 % (9287)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.53/0.74 % (9294)Refutation not found, incomplete strategy% (9294)------------------------------
% 0.53/0.74 % (9294)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.74 % (9291)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.53/0.74 % (9294)Termination reason: Refutation not found, incomplete strategy
% 0.53/0.74
% 0.53/0.74 % (9294)Memory used [KB]: 969
% 0.53/0.74 % (9289)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.53/0.74 % (9294)Time elapsed: 0.002 s
% 0.53/0.74 % (9294)Instructions burned: 3 (million)
% 0.53/0.74 % (9288)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.53/0.74 % (9290)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.53/0.74 % (9292)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.53/0.74 % (9293)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.53/0.74 % (9294)------------------------------
% 0.53/0.74 % (9294)------------------------------
% 0.58/0.74 % (9290)First to succeed.
% 0.58/0.74 % (9295)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 theBenchmark for (2996ds/55Mi)
% 0.58/0.74 % (9290)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-9286"
% 0.58/0.74 % (9290)Refutation found. Thanks to Tanya!
% 0.58/0.74 % SZS status Theorem for theBenchmark
% 0.58/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.58/0.74 % (9290)------------------------------
% 0.58/0.74 % (9290)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.74 % (9290)Termination reason: Refutation
% 0.58/0.74
% 0.58/0.74 % (9290)Memory used [KB]: 980
% 0.58/0.74 % (9290)Time elapsed: 0.004 s
% 0.58/0.74 % (9290)Instructions burned: 4 (million)
% 0.58/0.74 % (9286)Success in time 0.383 s
% 0.58/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------