TSTP Solution File: DAT003_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT003_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 : n012.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:16 EDT 2024
% Result : Theorem 0.56s 0.73s
% Output : Refutation 0.56s
% 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/sandbox2/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,[],[f28,f12]) ).
tff(f12,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(f28,plain,
! [X0: $int] :
( ( read(sK0,X0) = read(write(sK1,3,33),X0) )
| ( 4 = X0 )
| ( 5 = X0 ) ),
inference(duplicate_literal_removal,[],[f24]) ).
tff(f24,plain,
! [X0: $int] :
( ( read(sK0,X0) = read(write(sK1,3,33),X0) )
| ( 4 = X0 )
| ( 5 = X0 )
| ( 4 = X0 ) ),
inference(superposition,[],[f18,f11]) ).
tff(f11,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/sandbox2/benchmark/theBenchmark.p',ax2) ).
tff(f18,plain,
! [X0: $int] :
( ( read(sK0,X0) = read(write(write(sK1,3,33),4,444),X0) )
| ( 4 = X0 )
| ( 5 = X0 ) ),
inference(superposition,[],[f14,f11]) ).
tff(f14,plain,
! [X0: $int] :
( ( read(write(write(write(sK1,3,33),4,444),5,55),X0) = read(sK0,X0) )
| ( 4 = X0 ) ),
inference(superposition,[],[f11,f9]) ).
tff(f9,plain,
sK0 = write(write(write(write(sK1,3,33),4,444),5,55),4,44),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : DAT003_1 : TPTP v8.2.0. Released v5.0.0.
% 0.12/0.13 % 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.12/0.34 % Computer : n012.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun May 19 23:17:08 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 This is a TF0_THM_EQU_ARI problem
% 0.12/0.34 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.56/0.73 % (21948)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.56/0.73 % (21941)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.56/0.73 % (21943)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.56/0.73 % (21948)Refutation not found, incomplete strategy% (21948)------------------------------
% 0.56/0.73 % (21948)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73 % (21948)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.73
% 0.56/0.73 % (21948)Memory used [KB]: 968
% 0.56/0.73 % (21948)Time elapsed: 0.001 s
% 0.56/0.73 % (21948)Instructions burned: 2 (million)
% 0.56/0.73 % (21948)------------------------------
% 0.56/0.73 % (21948)------------------------------
% 0.56/0.73 % (21944)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.56/0.73 % (21942)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 (2996ds/51Mi)
% 0.56/0.73 % (21946)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.56/0.73 % (21945)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.56/0.73 % (21947)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.56/0.73 % (21941)Refutation not found, incomplete strategy% (21941)------------------------------
% 0.56/0.73 % (21941)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73 % (21941)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.73
% 0.56/0.73 % (21941)Memory used [KB]: 983
% 0.56/0.73 % (21941)Time elapsed: 0.003 s
% 0.56/0.73 % (21941)Instructions burned: 2 (million)
% 0.56/0.73 % (21941)------------------------------
% 0.56/0.73 % (21941)------------------------------
% 0.56/0.73 % (21945)Refutation not found, incomplete strategy% (21945)------------------------------
% 0.56/0.73 % (21945)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73 % (21945)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.73
% 0.56/0.73 % (21945)Memory used [KB]: 983
% 0.56/0.73 % (21945)Time elapsed: 0.003 s
% 0.56/0.73 % (21945)Instructions burned: 2 (million)
% 0.56/0.73 % (21944)Refutation not found, incomplete strategy% (21944)------------------------------
% 0.56/0.73 % (21944)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73 % (21944)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.73
% 0.56/0.73 % (21944)Memory used [KB]: 985
% 0.56/0.73 % (21944)Time elapsed: 0.003 s
% 0.56/0.73 % (21944)Instructions burned: 2 (million)
% 0.56/0.73 % (21945)------------------------------
% 0.56/0.73 % (21945)------------------------------
% 0.56/0.73 % (21943)First to succeed.
% 0.56/0.73 % (21944)------------------------------
% 0.56/0.73 % (21944)------------------------------
% 0.56/0.73 % (21946)Also succeeded, but the first one will report.
% 0.56/0.73 % (21949)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2996ds/55Mi)
% 0.56/0.73 % (21942)Also succeeded, but the first one will report.
% 0.56/0.73 % (21943)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-21940"
% 0.56/0.73 % (21947)Also succeeded, but the first one will report.
% 0.56/0.73 % (21943)Refutation found. Thanks to Tanya!
% 0.56/0.73 % SZS status Theorem for theBenchmark
% 0.56/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.56/0.73 % (21943)------------------------------
% 0.56/0.73 % (21943)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73 % (21943)Termination reason: Refutation
% 0.56/0.73
% 0.56/0.73 % (21943)Memory used [KB]: 1000
% 0.56/0.73 % (21943)Time elapsed: 0.005 s
% 0.56/0.73 % (21943)Instructions burned: 5 (million)
% 0.56/0.73 % (21940)Success in time 0.383 s
% 0.56/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------