TSTP Solution File: ARI122_1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : ARI122_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 : n021.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:30 EDT 2022
% Result : Theorem 0.18s 0.46s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 13 unt; 4 typ; 0 def)
% Number of atoms : 58 ( 57 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 47 ( 10 ~; 0 |; 33 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 139 ( 0 atm; 42 fun; 69 num; 28 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 : 10 ( 4 usr; 9 con; 0-2 aty)
% Number of variables : 28 ( 12 !; 16 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_8,type,
sK0: $int ).
tff(func_def_9,type,
sK1: $int ).
tff(func_def_10,type,
sK2: $int ).
tff(func_def_11,type,
sK3: $int ).
tff(f40,plain,
$false,
inference(subsumption_resolution,[],[f39,f37]) ).
tff(f37,plain,
sK0 != 36,
inference(backward_demodulation,[],[f30,f36]) ).
tff(f36,plain,
sK3 = 36,
inference(evaluation,[],[f35]) ).
tff(f35,plain,
$product(2,18) = sK3,
inference(forward_demodulation,[],[f27,f33]) ).
tff(f33,plain,
sK2 = 18,
inference(evaluation,[],[f29]) ).
tff(f29,plain,
$product(3,6) = sK2,
inference(cnf_transformation,[],[f26]) ).
tff(f26,plain,
( ( sK0 = $product(sK1,6) )
& ( sK0 != sK3 )
& ( $product(3,6) = sK2 )
& ( $product(2,3) = sK1 )
& ( $product(2,sK2) = sK3 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f24,f25]) ).
tff(f25,plain,
( ? [X0: $int,X1: $int,X2: $int,X3: $int] :
( ( $product(X1,6) = X0 )
& ( X0 != X3 )
& ( $product(3,6) = X2 )
& ( $product(2,3) = X1 )
& ( $product(2,X2) = X3 ) )
=> ( ( sK0 = $product(sK1,6) )
& ( sK0 != sK3 )
& ( $product(3,6) = sK2 )
& ( $product(2,3) = sK1 )
& ( $product(2,sK2) = sK3 ) ) ),
introduced(choice_axiom,[]) ).
tff(f24,plain,
? [X0: $int,X1: $int,X2: $int,X3: $int] :
( ( $product(X1,6) = X0 )
& ( X0 != X3 )
& ( $product(3,6) = X2 )
& ( $product(2,3) = X1 )
& ( $product(2,X2) = X3 ) ),
inference(rectify,[],[f23]) ).
tff(f23,plain,
? [X2: $int,X0: $int,X1: $int,X3: $int] :
( ( $product(X0,6) = X2 )
& ( X2 != X3 )
& ( $product(3,6) = X1 )
& ( $product(2,3) = X0 )
& ( $product(2,X1) = X3 ) ),
inference(flattening,[],[f22]) ).
tff(f22,plain,
? [X2: $int,X1: $int,X0: $int,X3: $int] :
( ( X2 != X3 )
& ( $product(2,3) = X0 )
& ( $product(3,6) = X1 )
& ( $product(2,X1) = X3 )
& ( $product(X0,6) = X2 ) ),
inference(ennf_transformation,[],[f21]) ).
tff(f21,plain,
~ ! [X2: $int,X1: $int,X0: $int,X3: $int] :
( ( ( $product(2,3) = X0 )
& ( $product(3,6) = X1 )
& ( $product(2,X1) = X3 )
& ( $product(X0,6) = X2 ) )
=> ( X2 = X3 ) ),
inference(rectify,[],[f2]) ).
tff(f2,negated_conjecture,
~ ! [X0: $int,X2: $int,X1: $int,X3: $int] :
( ( ( $product(2,X2) = X3 )
& ( $product(X0,6) = X1 )
& ( $product(3,6) = X2 )
& ( $product(2,3) = X0 ) )
=> ( X1 = X3 ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
! [X0: $int,X2: $int,X1: $int,X3: $int] :
( ( ( $product(2,X2) = X3 )
& ( $product(X0,6) = X1 )
& ( $product(3,6) = X2 )
& ( $product(2,3) = X0 ) )
=> ( X1 = X3 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associative_product) ).
tff(f27,plain,
$product(2,sK2) = sK3,
inference(cnf_transformation,[],[f26]) ).
tff(f30,plain,
sK0 != sK3,
inference(cnf_transformation,[],[f26]) ).
tff(f39,plain,
sK0 = 36,
inference(evaluation,[],[f38]) ).
tff(f38,plain,
$product(6,6) = sK0,
inference(forward_demodulation,[],[f31,f34]) ).
tff(f34,plain,
6 = sK1,
inference(evaluation,[],[f28]) ).
tff(f28,plain,
$product(2,3) = sK1,
inference(cnf_transformation,[],[f26]) ).
tff(f31,plain,
sK0 = $product(sK1,6),
inference(cnf_transformation,[],[f26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : ARI122=1 : TPTP v8.1.0. Released v5.0.0.
% 0.06/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Aug 29 15:19:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 % (5545)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.18/0.45 % (5545)First to succeed.
% 0.18/0.45 % (5559)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/138Mi)
% 0.18/0.46 % (5545)Refutation found. Thanks to Tanya!
% 0.18/0.46 % SZS status Theorem for theBenchmark
% 0.18/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.46 % (5545)------------------------------
% 0.18/0.46 % (5545)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.46 % (5545)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.46 % (5545)Termination reason: Refutation
% 0.18/0.46
% 0.18/0.46 % (5545)Memory used [KB]: 5373
% 0.18/0.46 % (5545)Time elapsed: 0.066 s
% 0.18/0.46 % (5545)Instructions burned: 2 (million)
% 0.18/0.46 % (5545)------------------------------
% 0.18/0.46 % (5545)------------------------------
% 0.18/0.46 % (5537)Success in time 0.116 s
%------------------------------------------------------------------------------