TSTP Solution File: ARI083_1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : ARI083_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n004.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 : Tue Apr 30 10:34:34 EDT 2024
% Result : Theorem 0.13s 0.37s
% Output : Refutation 0.13s
% 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(f22,plain,
$false,
inference(equality_resolution,[],[f21]) ).
tff(f21,plain,
! [X6: $int,X4: $int] : ( X4 != X6 ),
inference(cnf_transformation,[],[f16]) ).
tff(f16,plain,
! [X0: $int,X1: $int,X2: $int,X3: $int,X4: $int,X5: $int,X6: $int] :
( ( X4 != X6 )
& ( $sum(X0,X5) = X6 )
& ( $sum(X1,X2) = X5 )
& ( $sum(X3,X2) = X4 )
& ( $sum(X0,X1) = X3 ) ),
inference(flattening,[],[f15]) ).
tff(f15,plain,
! [X0: $int,X1: $int,X2: $int,X3: $int,X4: $int,X5: $int,X6: $int] :
( ( X4 != X6 )
& ( $sum(X0,X5) = X6 )
& ( $sum(X1,X2) = X5 )
& ( $sum(X3,X2) = X4 )
& ( $sum(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] :
( ( ( $sum(X0,X5) = X6 )
& ( $sum(X1,X2) = X5 )
& ( $sum(X3,X2) = X4 )
& ( $sum(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] :
( ( ( $sum(X0,X5) = X6 )
& ( $sum(X1,X2) = X5 )
& ( $sum(X3,X2) = X4 )
& ( $sum(X0,X1) = X3 ) )
=> ( X4 = X6 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associative_sum_exists) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ARI083_1 : TPTP v8.1.2. Released v5.0.0.
% 0.11/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.35 % Computer : n004.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 : Tue Apr 30 05:26:33 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % (1380)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.36 % (1386)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.13/0.36 % (1386)First to succeed.
% 0.13/0.37 % (1386)Refutation found. Thanks to Tanya!
% 0.13/0.37 % SZS status Theorem for theBenchmark
% 0.13/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.37 % (1386)------------------------------
% 0.13/0.37 % (1386)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.13/0.37 % (1386)Termination reason: Refutation
% 0.13/0.37
% 0.13/0.37 % (1386)Memory used [KB]: 732
% 0.13/0.37 % (1386)Time elapsed: 0.002 s
% 0.13/0.37 % (1386)Instructions burned: 2 (million)
% 0.13/0.37 % (1386)------------------------------
% 0.13/0.37 % (1386)------------------------------
% 0.13/0.37 % (1380)Success in time 0.01 s
%------------------------------------------------------------------------------