TSTP Solution File: DAT003_1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : DAT003_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 : n002.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 11:03:25 EDT 2024
% Result : Theorem 0.12s 0.37s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 24 ( 6 unt; 5 typ; 0 def)
% Number of atoms : 39 ( 38 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 26 ( 6 ~; 13 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number arithmetic : 117 ( 0 atm; 0 fun; 100 num; 17 var)
% Number of types : 2 ( 1 usr; 1 ari)
% Number of type conns : 5 ( 2 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 4 usr; 9 con; 0-3 aty)
% Number of variables : 30 ( 26 !; 4 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
array: $tType ).
tff(func_def_0,type,
read: ( array * $int ) > $int ).
tff(func_def_1,type,
write: ( array * $int * $int ) > array ).
tff(func_def_9,type,
sK0: array ).
tff(func_def_10,type,
sK1: array ).
tff(f35,plain,
$false,
inference(subsumption_resolution,[],[f34,f10]) ).
tff(f10,plain,
33 != read(sK0,3),
inference(cnf_transformation,[],[f8]) ).
tff(f8,plain,
( ( 33 != read(sK0,3) )
& ( sK0 = write(write(write(write(sK1,3,33),4,444),5,55),4,44) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f7]) ).
tff(f7,plain,
( ? [X0: array,X1: array] :
( ( 33 != read(X0,3) )
& ( write(write(write(write(X1,3,33),4,444),5,55),4,44) = X0 ) )
=> ( ( 33 != read(sK0,3) )
& ( sK0 = write(write(write(write(sK1,3,33),4,444),5,55),4,44) ) ) ),
introduced(choice_axiom,[]) ).
tff(f6,plain,
? [X0: array,X1: array] :
( ( 33 != read(X0,3) )
& ( write(write(write(write(X1,3,33),4,444),5,55),4,44) = X0 ) ),
inference(ennf_transformation,[],[f4]) ).
tff(f4,negated_conjecture,
~ ! [X0: array,X1: array] :
( ( write(write(write(write(X1,3,33),4,444),5,55),4,44) = X0 )
=> ( 33 = read(X0,3) ) ),
inference(negated_conjecture,[],[f3]) ).
tff(f3,conjecture,
! [X0: array,X1: array] :
( ( write(write(write(write(X1,3,33),4,444),5,55),4,44) = X0 )
=> ( 33 = read(X0,3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(f34,plain,
33 = read(sK0,3),
inference(evaluation,[],[f29]) ).
tff(f29,plain,
( ( 33 = read(sK0,3) )
| ( 3 = 4 )
| ( 3 = 5 ) ),
inference(superposition,[],[f27,f11]) ).
tff(f11,plain,
! [X2: $int,X0: array,X1: $int] : ( read(write(X0,X1,X2),X1) = X2 ),
inference(cnf_transformation,[],[f1]) ).
tff(f1,axiom,
! [X0: array,X1: $int,X2: $int] : ( read(write(X0,X1,X2),X1) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
tff(f27,plain,
! [X0: $int] :
( ( read(sK0,X0) = read(write(sK1,3,33),X0) )
| ( 4 = X0 )
| ( 5 = X0 ) ),
inference(duplicate_literal_removal,[],[f26]) ).
tff(f26,plain,
! [X0: $int] :
( ( read(sK0,X0) = read(write(sK1,3,33),X0) )
| ( 4 = X0 )
| ( 4 = X0 )
| ( 5 = X0 ) ),
inference(superposition,[],[f12,f18]) ).
tff(f18,plain,
! [X0: $int] :
( ( read(sK0,X0) = read(write(write(sK1,3,33),4,444),X0) )
| ( 4 = X0 )
| ( 5 = X0 ) ),
inference(superposition,[],[f14,f12]) ).
tff(f14,plain,
! [X0: $int] :
( ( read(write(write(write(sK1,3,33),4,444),5,55),X0) = read(sK0,X0) )
| ( 4 = X0 ) ),
inference(superposition,[],[f12,f9]) ).
tff(f9,plain,
sK0 = write(write(write(write(sK1,3,33),4,444),5,55),4,44),
inference(cnf_transformation,[],[f8]) ).
tff(f12,plain,
! [X2: $int,X3: $int,X0: array,X1: $int] :
( ( read(write(X0,X1,X3),X2) = read(X0,X2) )
| ( X1 = X2 ) ),
inference(cnf_transformation,[],[f5]) ).
tff(f5,plain,
! [X0: array,X1: $int,X2: $int,X3: $int] :
( ( read(write(X0,X1,X3),X2) = read(X0,X2) )
| ( X1 = X2 ) ),
inference(rectify,[],[f2]) ).
tff(f2,axiom,
! [X3: array,X4: $int,X5: $int,X6: $int] :
( ( read(write(X3,X4,X6),X5) = read(X3,X5) )
| ( X4 = X5 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : DAT003_1 : TPTP v8.1.2. Released v5.0.0.
% 0.05/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.12/0.33 % Computer : n002.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 Apr 29 22:28:09 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % (14294)Running in auto input_syntax mode. Trying TPTP
% 0.12/0.36 % (14297)WARNING: value z3 for option sas not known
% 0.12/0.36 % (14297)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.12/0.36 % (14297)First to succeed.
% 0.12/0.37 % (14297)Refutation found. Thanks to Tanya!
% 0.12/0.37 % SZS status Theorem for theBenchmark
% 0.12/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.37 % (14297)------------------------------
% 0.12/0.37 % (14297)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.12/0.37 % (14297)Termination reason: Refutation
% 0.12/0.37
% 0.12/0.37 % (14297)Memory used [KB]: 765
% 0.12/0.37 % (14297)Time elapsed: 0.005 s
% 0.12/0.37 % (14297)Instructions burned: 4 (million)
% 0.12/0.37 % (14297)------------------------------
% 0.12/0.37 % (14297)------------------------------
% 0.12/0.37 % (14294)Success in time 0.029 s
%------------------------------------------------------------------------------