TSTP Solution File: ARI123_1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : ARI123_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_uns --cores 0 -t %d %s
% Computer : n029.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:45:29 EDT 2022
% Result : Theorem 0.19s 0.52s
% Output : Refutation 0.19s
% 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(f30,plain,
$false,
inference(equality_resolution,[],[f29]) ).
tff(f29,plain,
! [X2: $int,X5: $int] : ( X2 != X5 ),
inference(cnf_transformation,[],[f24]) ).
tff(f24,plain,
! [X0: $int,X1: $int,X2: $int,X3: $int,X4: $int,X5: $int,X6: $int] :
( ( X2 != X5 )
& ( $product(X6,X3) = X0 )
& ( $product(X4,X0) = X2 )
& ( $product(X1,X3) = X5 )
& ( $product(X4,X6) = X1 ) ),
inference(rectify,[],[f23]) ).
tff(f23,plain,
! [X4: $int,X6: $int,X5: $int,X3: $int,X1: $int,X0: $int,X2: $int] :
( ( X0 != X5 )
& ( $product(X2,X3) = X4 )
& ( $product(X1,X4) = X5 )
& ( $product(X6,X3) = X0 )
& ( $product(X1,X2) = X6 ) ),
inference(flattening,[],[f22]) ).
tff(f22,plain,
! [X2: $int,X1: $int,X4: $int,X5: $int,X6: $int,X0: $int,X3: $int] :
( ( X0 != X5 )
& ( $product(X6,X3) = X0 )
& ( $product(X1,X4) = X5 )
& ( $product(X1,X2) = X6 )
& ( $product(X2,X3) = X4 ) ),
inference(ennf_transformation,[],[f21]) ).
tff(f21,plain,
~ ? [X2: $int,X1: $int,X4: $int,X5: $int,X6: $int,X0: $int,X3: $int] :
( ( ( $product(X6,X3) = X0 )
& ( $product(X1,X4) = X5 )
& ( $product(X1,X2) = X6 )
& ( $product(X2,X3) = X4 ) )
=> ( X0 = X5 ) ),
inference(rectify,[],[f2]) ).
tff(f2,negated_conjecture,
~ ? [X4: $int,X0: $int,X1: $int,X2: $int,X5: $int,X6: $int,X3: $int] :
( ( ( $product(X0,X5) = X6 )
& ( $product(X3,X2) = X4 )
& ( $product(X0,X1) = X3 )
& ( $product(X1,X2) = X5 ) )
=> ( X4 = X6 ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
? [X4: $int,X0: $int,X1: $int,X2: $int,X5: $int,X6: $int,X3: $int] :
( ( ( $product(X0,X5) = X6 )
& ( $product(X3,X2) = X4 )
& ( $product(X0,X1) = X3 )
& ( $product(X1,X2) = X5 ) )
=> ( X4 = X6 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associative_product_exists) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : ARI123=1 : TPTP v8.1.0. Released v5.0.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.35 % Computer : n029.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Mon Aug 29 15:32:41 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.19/0.50 % (26781)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=32:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/32Mi)
% 0.19/0.51 % (26798)dis+32_1:1_bd=off:nm=4:sos=on:ss=included:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.51 % (26783)lrs+1010_1:1_ep=RST:s2a=on:s2at=5.0:sos=all:i=26:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/26Mi)
% 0.19/0.52 % (26790)dis+20_1:12_aac=none:acc=model:awrs=converge:fd=preordered:fsr=off:nicw=on:nwc=3.0:s2a=on:s2agt=16:spb=goal:to=lpo:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.52 % (26782)lrs+1010_1:1_bd=off:fd=off:fde=none:ins=3:sac=on:sos=on:spb=goal:to=lpo:i=36:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/36Mi)
% 0.19/0.52 % (26782)First to succeed.
% 0.19/0.52 % (26782)Refutation found. Thanks to Tanya!
% 0.19/0.52 % SZS status Theorem for theBenchmark
% 0.19/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52 % (26782)------------------------------
% 0.19/0.52 % (26782)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (26782)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (26782)Termination reason: Refutation
% 0.19/0.52
% 0.19/0.52 % (26782)Memory used [KB]: 5373
% 0.19/0.52 % (26782)Time elapsed: 0.005 s
% 0.19/0.52 % (26782)Instructions burned: 2 (million)
% 0.19/0.52 % (26782)------------------------------
% 0.19/0.52 % (26782)------------------------------
% 0.19/0.52 % (26774)Success in time 0.162 s
%------------------------------------------------------------------------------