TSTP Solution File: ARI123_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ARI123_1 : TPTP v8.2.0. Released v5.0.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 : n012.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:46:38 EDT 2024
% Result : Theorem 0.56s 0.75s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 6 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 22 ( 21 equ)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 20 ( 4 ~; 0 |; 14 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 46 ( 0 atm; 16 fun; 0 num; 30 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 0 usr; 0 con; 2-2 aty)
% Number of variables : 30 ( 16 !; 14 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
tff(f28,plain,
$false,
inference(equality_resolution,[],[f27]) ).
tff(f27,plain,
! [X6: $int,X4: $int] : ( X4 != X6 ),
inference(cnf_transformation,[],[f22]) ).
tff(f22,plain,
! [X0: $int,X1: $int,X2: $int,X3: $int,X4: $int,X5: $int,X6: $int] :
( ( X4 != X6 )
& ( $product(X0,X5) = X6 )
& ( $product(X1,X2) = X5 )
& ( $product(X3,X2) = X4 )
& ( $product(X0,X1) = X3 ) ),
inference(flattening,[],[f21]) ).
tff(f21,plain,
! [X0: $int,X1: $int,X2: $int,X3: $int,X4: $int,X5: $int,X6: $int] :
( ( X4 != X6 )
& ( $product(X0,X5) = X6 )
& ( $product(X1,X2) = X5 )
& ( $product(X3,X2) = X4 )
& ( $product(X0,X1) = X3 ) ),
inference(ennf_transformation,[],[f2]) ).
tff(f2,negated_conjecture,
~ ? [X0: $int,X1: $int,X2: $int,X3: $int,X4: $int,X5: $int,X6: $int] :
( ( ( $product(X0,X5) = X6 )
& ( $product(X1,X2) = X5 )
& ( $product(X3,X2) = X4 )
& ( $product(X0,X1) = X3 ) )
=> ( X4 = X6 ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
? [X0: $int,X1: $int,X2: $int,X3: $int,X4: $int,X5: $int,X6: $int] :
( ( ( $product(X0,X5) = X6 )
& ( $product(X1,X2) = X5 )
& ( $product(X3,X2) = X4 )
& ( $product(X0,X1) = X3 ) )
=> ( X4 = X6 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associative_product_exists) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ARI123_1 : TPTP v8.2.0. Released v5.0.0.
% 0.13/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.13/0.35 % Computer : n012.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 : Sun May 19 13:27:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TF0_THM_EQU_ARI problem
% 0.13/0.35 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.56/0.75 % (3481)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.56/0.75 % (3481)First to succeed.
% 0.56/0.75 % (3475)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.56/0.75 % (3477)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.56/0.75 % (3478)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.56/0.75 % (3481)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3328"
% 0.56/0.75 % (3476)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.56/0.75 % (3480)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.56/0.75 % (3479)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.56/0.75 % (3482)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.56/0.75 % (3478)Also succeeded, but the first one will report.
% 0.56/0.75 % (3475)Also succeeded, but the first one will report.
% 0.56/0.75 % (3476)Also succeeded, but the first one will report.
% 0.56/0.75 % (3477)Also succeeded, but the first one will report.
% 0.56/0.75 % (3481)Refutation found. Thanks to Tanya!
% 0.56/0.75 % SZS status Theorem for theBenchmark
% 0.56/0.75 % SZS output start Proof for theBenchmark
% See solution above
% 0.56/0.75 % (3481)------------------------------
% 0.56/0.75 % (3481)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.75 % (3481)Termination reason: Refutation
% 0.56/0.75
% 0.56/0.75 % (3481)Memory used [KB]: 957
% 0.56/0.75 % (3481)Time elapsed: 0.002 s
% 0.56/0.75 % (3481)Instructions burned: 3 (million)
% 0.56/0.75 % (3328)Success in time 0.392 s
% 0.56/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------