TSTP Solution File: ARI083_1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : ARI083_1 : TPTP v8.1.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n024.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 Aug 31 15:47:24 EDT 2022
% Result : Theorem 0.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 8 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 32 ( 31 equ)
% Maximal formula atoms : 5 ( 4 avg)
% Number of connectives : 30 ( 6 ~; 0 |; 21 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 10 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 68 ( 0 atm; 24 fun; 0 num; 44 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 : 44 ( 23 !; 21 ?; 44 :)
% Comments :
%------------------------------------------------------------------------------
tff(f24,plain,
$false,
inference(equality_resolution,[],[f23]) ).
tff(f23,plain,
! [X3: $int,X5: $int] : ( X3 != X5 ),
inference(cnf_transformation,[],[f18]) ).
tff(f18,plain,
! [X0: $int,X1: $int,X2: $int,X3: $int,X4: $int,X5: $int,X6: $int] :
( ( X3 != X5 )
& ( $sum(X0,X2) = X3 )
& ( $sum(X4,X6) = X0 )
& ( $sum(X4,X1) = X5 )
& ( $sum(X6,X2) = X1 ) ),
inference(rectify,[],[f17]) ).
tff(f17,plain,
! [X6: $int,X4: $int,X3: $int,X5: $int,X1: $int,X0: $int,X2: $int] :
( ( X0 != X5 )
& ( $sum(X6,X3) = X5 )
& ( $sum(X1,X2) = X6 )
& ( $sum(X1,X4) = X0 )
& ( $sum(X2,X3) = X4 ) ),
inference(flattening,[],[f16]) ).
tff(f16,plain,
! [X6: $int,X5: $int,X2: $int,X3: $int,X4: $int,X0: $int,X1: $int] :
( ( X0 != X5 )
& ( $sum(X1,X2) = X6 )
& ( $sum(X2,X3) = X4 )
& ( $sum(X1,X4) = X0 )
& ( $sum(X6,X3) = X5 ) ),
inference(ennf_transformation,[],[f15]) ).
tff(f15,plain,
~ ? [X6: $int,X5: $int,X2: $int,X3: $int,X4: $int,X0: $int,X1: $int] :
( ( ( $sum(X1,X2) = X6 )
& ( $sum(X2,X3) = X4 )
& ( $sum(X1,X4) = X0 )
& ( $sum(X6,X3) = X5 ) )
=> ( X0 = X5 ) ),
inference(rectify,[],[f2]) ).
tff(f2,negated_conjecture,
~ ? [X6: $int,X0: $int,X1: $int,X2: $int,X5: $int,X4: $int,X3: $int] :
( ( ( $sum(X3,X2) = X4 )
& ( $sum(X1,X2) = X5 )
& ( $sum(X0,X1) = X3 )
& ( $sum(X0,X5) = X6 ) )
=> ( X4 = X6 ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
? [X6: $int,X0: $int,X1: $int,X2: $int,X5: $int,X4: $int,X3: $int] :
( ( ( $sum(X3,X2) = X4 )
& ( $sum(X1,X2) = X5 )
& ( $sum(X0,X1) = X3 )
& ( $sum(X0,X5) = X6 ) )
=> ( X4 = X6 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associative_sum_exists) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ARI083=1 : TPTP v8.1.0. Released v5.0.0.
% 0.06/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 29 15:23:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.49 % (14401)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/355Mi)
% 0.20/0.49 % (14385)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 0.20/0.49 % (14385)First to succeed.
% 0.20/0.50 % (14393)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/138Mi)
% 0.20/0.50 % (14385)Refutation found. Thanks to Tanya!
% 0.20/0.50 % SZS status Theorem for theBenchmark
% 0.20/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50 % (14385)------------------------------
% 0.20/0.50 % (14385)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (14385)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (14385)Termination reason: Refutation
% 0.20/0.50
% 0.20/0.50 % (14385)Memory used [KB]: 5373
% 0.20/0.50 % (14385)Time elapsed: 0.005 s
% 0.20/0.50 % (14385)Instructions burned: 2 (million)
% 0.20/0.50 % (14385)------------------------------
% 0.20/0.50 % (14385)------------------------------
% 0.20/0.50 % (14371)Success in time 0.15 s
%------------------------------------------------------------------------------