TSTP Solution File: DAT061_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT061_1 : TPTP v8.2.0. Released v5.5.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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n006.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:30 EDT 2024
% Result : Theorem 0.61s 0.79s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of formulae : 28 ( 6 unt; 11 typ; 0 def)
% Number of atoms : 30 ( 19 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 27 ( 14 ~; 6 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 29 ( 10 atm; 0 fun; 0 num; 19 var)
% Number of types : 3 ( 2 usr; 1 ari)
% Number of type conns : 7 ( 3 >; 4 *; 0 +; 0 <<)
% Number of predicates : 3 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 37 ( 29 !; 8 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
data: $tType ).
tff(type_def_6,type,
array: $tType ).
tff(func_def_0,type,
mkarray: array ).
tff(func_def_1,type,
none: data ).
tff(func_def_2,type,
put: ( array * $int * data ) > array ).
tff(func_def_3,type,
get: ( array * $int ) > data ).
tff(func_def_8,type,
sK0: data ).
tff(func_def_9,type,
sK1: array ).
tff(func_def_10,type,
sK2: $int ).
tff(func_def_11,type,
sK3: $int ).
tff(func_def_12,type,
sK4: ( array * array ) > $int ).
tff(f45,plain,
$false,
inference(subsumption_resolution,[],[f44,f13]) ).
tff(f13,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(theory_axiom_142,[]) ).
tff(f44,plain,
$less(sK3,sK3),
inference(superposition,[],[f34,f42]) ).
tff(f42,plain,
sK2 = sK3,
inference(trivial_inequality_removal,[],[f41]) ).
tff(f41,plain,
( ( get(sK1,sK3) != get(sK1,sK3) )
| ( sK2 = sK3 ) ),
inference(superposition,[],[f33,f36]) ).
tff(f36,plain,
! [X2: array,X3: $int,X0: $int,X1: data] :
( ( get(put(X2,X0,X1),X3) = get(X2,X3) )
| ( X0 = X3 ) ),
inference(cnf_transformation,[],[f26]) ).
tff(f26,plain,
! [X0: $int,X1: data,X2: array,X3: $int] :
( ( get(put(X2,X0,X1),X3) = get(X2,X3) )
| ( X0 = X3 ) ),
inference(ennf_transformation,[],[f22]) ).
tff(f22,plain,
! [X0: $int,X1: data,X2: array,X3: $int] :
( ( X0 != X3 )
=> ( get(put(X2,X0,X1),X3) = get(X2,X3) ) ),
inference(rectify,[],[f3]) ).
tff(f3,axiom,
! [X3: $int,X2: data,X1: array,X0: $int] :
( ( X0 != X3 )
=> ( get(put(X1,X3,X2),X0) = get(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_19) ).
tff(f33,plain,
get(sK1,sK3) != get(put(sK1,sK2,sK0),sK3),
inference(cnf_transformation,[],[f28]) ).
tff(f28,plain,
( $less(sK2,sK3)
& ( get(sK1,sK3) != get(put(sK1,sK2,sK0),sK3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f25,f27]) ).
tff(f27,plain,
( ? [X0: data,X1: array,X2: $int,X3: $int] :
( $less(X2,X3)
& ( get(X1,X3) != get(put(X1,X2,X0),X3) ) )
=> ( $less(sK2,sK3)
& ( get(sK1,sK3) != get(put(sK1,sK2,sK0),sK3) ) ) ),
introduced(choice_axiom,[]) ).
tff(f25,plain,
? [X0: data,X1: array,X2: $int,X3: $int] :
( $less(X2,X3)
& ( get(X1,X3) != get(put(X1,X2,X0),X3) ) ),
inference(ennf_transformation,[],[f20]) ).
tff(f20,plain,
~ ! [X0: data,X1: array,X2: $int,X3: $int] :
( ~ $less(X2,X3)
| ( get(X1,X3) = get(put(X1,X2,X0),X3) ) ),
inference(rectify,[],[f7]) ).
tff(f7,negated_conjecture,
~ ! [X2: data,X1: array,X0: $int,X3: $int] :
( ~ $less(X0,X3)
| ( get(X1,X3) = get(put(X1,X0,X2),X3) ) ),
inference(negated_conjecture,[],[f6]) ).
tff(f6,conjecture,
! [X2: data,X1: array,X0: $int,X3: $int] :
( ~ $less(X0,X3)
| ( get(X1,X3) = get(put(X1,X0,X2),X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',th_lem_7) ).
tff(f34,plain,
$less(sK2,sK3),
inference(cnf_transformation,[],[f28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : DAT061_1 : TPTP v8.2.0. Released v5.5.0.
% 0.03/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36 % Computer : n006.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 23:22:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TF0_THM_EQU_ARI problem
% 0.14/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.61/0.78 % (6398)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 (2995ds/34Mi)
% 0.61/0.78 % (6400)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.61/0.78 % (6401)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.61/0.78 % (6399)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2995ds/51Mi)
% 0.61/0.78 % (6402)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 (2995ds/34Mi)
% 0.61/0.78 % (6403)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.61/0.78 % (6406)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 (2995ds/56Mi)
% 0.61/0.78 % (6405)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 (2995ds/83Mi)
% 0.61/0.78 % (6406)Refutation not found, incomplete strategy% (6406)------------------------------
% 0.61/0.78 % (6406)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.78 % (6406)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.78
% 0.61/0.78 % (6406)Memory used [KB]: 988
% 0.61/0.78 % (6406)Time elapsed: 0.003 s
% 0.61/0.78 % (6406)Instructions burned: 3 (million)
% 0.61/0.78 % (6403)First to succeed.
% 0.61/0.78 % (6406)------------------------------
% 0.61/0.78 % (6406)------------------------------
% 0.61/0.79 % (6405)Also succeeded, but the first one will report.
% 0.61/0.79 % (6403)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-6384"
% 0.61/0.79 % (6401)Also succeeded, but the first one will report.
% 0.61/0.79 % (6403)Refutation found. Thanks to Tanya!
% 0.61/0.79 % SZS status Theorem for theBenchmark
% 0.61/0.79 % SZS output start Proof for theBenchmark
% See solution above
% 0.61/0.79 % (6403)------------------------------
% 0.61/0.79 % (6403)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.79 % (6403)Termination reason: Refutation
% 0.61/0.79
% 0.61/0.79 % (6403)Memory used [KB]: 997
% 0.61/0.79 % (6403)Time elapsed: 0.004 s
% 0.61/0.79 % (6403)Instructions burned: 3 (million)
% 0.61/0.79 % (6384)Success in time 0.42 s
% 0.61/0.79 % Vampire---4.8 exiting
%------------------------------------------------------------------------------