TSTP Solution File: DAT007_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT007_1 : TPTP v8.2.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n009.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 : Mon May 20 19:49:17 EDT 2024
% Result : Theorem 0.55s 0.75s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 23 ( 5 unt; 5 typ; 0 def)
% Number of atoms : 39 ( 28 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 28 ( 7 ~; 16 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 105 ( 10 atm; 0 fun; 74 num; 21 var)
% Number of types : 2 ( 1 usr; 1 ari)
% Number of type conns : 5 ( 2 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 4 usr; 11 con; 0-3 aty)
% Number of variables : 32 ( 28 !; 4 ?; 32 :)
% 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_15,type,
sK0: array ).
tff(func_def_16,type,
sK1: array ).
tff(f53,plain,
$false,
inference(evaluation,[],[f52]) ).
tff(f52,plain,
( ~ $less(33,40)
| ~ $less(30,33) ),
inference(superposition,[],[f19,f50]) ).
tff(f50,plain,
33 = read(sK0,3),
inference(evaluation,[],[f46]) ).
tff(f46,plain,
( ( 33 = read(sK0,3) )
| ( 3 = 4 )
| ( 3 = 5 ) ),
inference(superposition,[],[f44,f22]) ).
tff(f22,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/sandbox2/benchmark/theBenchmark.p',ax1) ).
tff(f44,plain,
! [X0: $int] :
( ( read(sK0,X0) = read(write(sK1,3,33),X0) )
| ( 4 = X0 )
| ( 5 = X0 ) ),
inference(duplicate_literal_removal,[],[f39]) ).
tff(f39,plain,
! [X0: $int] :
( ( read(sK0,X0) = read(write(sK1,3,33),X0) )
| ( 4 = X0 )
| ( 5 = X0 )
| ( 4 = X0 ) ),
inference(superposition,[],[f31,f21]) ).
tff(f21,plain,
! [X2: $int,X3: $int,X0: array,X1: $int] :
( ( read(X0,X2) = read(write(X0,X1,X3),X2) )
| ( X1 = X2 ) ),
inference(cnf_transformation,[],[f17]) ).
tff(f17,plain,
! [X0: array,X1: $int,X2: $int,X3: $int] :
( ( read(X0,X2) = read(write(X0,X1,X3),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/sandbox2/benchmark/theBenchmark.p',ax2) ).
tff(f31,plain,
! [X0: $int] :
( ( read(sK0,X0) = read(write(write(sK1,3,33),4,444),X0) )
| ( 4 = X0 )
| ( 5 = X0 ) ),
inference(superposition,[],[f26,f21]) ).
tff(f26,plain,
! [X0: $int] :
( ( read(sK0,X0) = read(write(write(write(sK1,3,33),4,444),5,55),X0) )
| ( 4 = X0 ) ),
inference(superposition,[],[f21,f20]) ).
tff(f20,plain,
sK0 = write(write(write(write(sK1,3,33),4,444),5,55),4,44),
inference(cnf_transformation,[],[f18]) ).
tff(f18,plain,
? [X0: array,X1: array] :
( ! [X2: $int] :
( ~ $less(30,read(X0,X2))
| ~ $less(read(X0,X2),40) )
& ( 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 )
=> ? [X2: $int] :
( $less(30,read(X0,X2))
& $less(read(X0,X2),40) ) ),
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 )
=> ? [X2: $int] :
( $less(30,read(X0,X2))
& $less(read(X0,X2),40) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(f19,plain,
! [X2: $int] :
( ~ $less(read(sK0,X2),40)
| ~ $less(30,read(sK0,X2)) ),
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : DAT007_1 : TPTP v8.2.0. Released v5.0.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n009.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 23:12:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TF0_THM_EQU_ARI problem
% 0.14/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.55/0.74 % (30417)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.55/0.75 % (30419)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2996ds/34Mi)
% 0.55/0.75 % (30418)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.55/0.75 % (30420)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.55/0.75 % (30421)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2996ds/83Mi)
% 0.55/0.75 % (30422)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.55/0.75 % (30415)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.55/0.75 % (30418)Refutation not found, incomplete strategy% (30418)------------------------------
% 0.55/0.75 % (30418)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75 % (30418)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.75
% 0.55/0.75 % (30418)Memory used [KB]: 989
% 0.55/0.75 % (30418)Time elapsed: 0.003 s
% 0.55/0.75 % (30418)Instructions burned: 3 (million)
% 0.55/0.75 % (30418)------------------------------
% 0.55/0.75 % (30418)------------------------------
% 0.55/0.75 % (30421)First to succeed.
% 0.55/0.75 % (30421)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-30365"
% 0.55/0.75 % (30421)Refutation found. Thanks to Tanya!
% 0.55/0.75 % SZS status Theorem for theBenchmark
% 0.55/0.75 % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.75 % (30421)------------------------------
% 0.55/0.75 % (30421)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75 % (30421)Termination reason: Refutation
% 0.55/0.75
% 0.55/0.75 % (30421)Memory used [KB]: 1066
% 0.55/0.75 % (30421)Time elapsed: 0.005 s
% 0.55/0.75 % (30421)Instructions burned: 5 (million)
% 0.55/0.75 % (30365)Success in time 0.393 s
% 0.55/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------