TSTP Solution File: DAT082_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT082_1 : TPTP v8.2.0. Released v6.1.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 : n024.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:35 EDT 2024
% Result : Theorem 0.73s 0.91s
% Output : Refutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 24 ( 14 unt; 10 typ; 0 def)
% Number of atoms : 14 ( 13 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 7 ( 7 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of FOOLs : 1 ( 1 fml; 0 var)
% Number arithmetic : 39 ( 0 atm; 8 fun; 28 num; 3 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 13 ( 8 >; 5 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 6 ( 6 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
list: $tType ).
tff(func_def_0,type,
nil: list ).
tff(func_def_1,type,
cons: ( $int * list ) > list ).
tff(func_def_2,type,
head: list > $int ).
tff(func_def_3,type,
tail: list > list ).
tff(func_def_5,type,
length: list > $int ).
tff(func_def_8,type,
count: ( $int * list ) > $int ).
tff(func_def_9,type,
append: ( list * list ) > list ).
tff(pred_def_1,type,
in: ( $int * list ) > $o ).
tff(pred_def_2,type,
inRange: ( $int * list ) > $o ).
tff(f61,plain,
$false,
inference(evaluation,[],[f60]) ).
tff(f60,plain,
2 != $sum(2,0),
inference(forward_demodulation,[],[f59,f40]) ).
tff(f40,plain,
0 = length(nil),
inference(cnf_transformation,[],[f7]) ).
tff(f7,axiom,
0 = length(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).
tff(f59,plain,
2 != $sum(2,length(nil)),
inference(evaluation,[],[f58]) ).
tff(f58,plain,
2 != $sum(1,$sum(1,length(nil))),
inference(forward_demodulation,[],[f47,f39]) ).
tff(f39,plain,
! [X0: $int,X1: list] : ( length(cons(X0,X1)) = $sum(1,length(X1)) ),
inference(cnf_transformation,[],[f32]) ).
tff(f32,plain,
! [X0: $int,X1: list] : ( length(cons(X0,X1)) = $sum(1,length(X1)) ),
inference(rectify,[],[f8]) ).
tff(f8,axiom,
! [X3: $int,X4: list] : ( length(cons(X3,X4)) = $sum(1,length(X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l_1) ).
tff(f47,plain,
2 != $sum(1,length(cons(2,nil))),
inference(superposition,[],[f37,f39]) ).
tff(f37,plain,
2 != length(cons(1,cons(2,nil))),
inference(cnf_transformation,[],[f31]) ).
tff(f31,plain,
2 != length(cons(1,cons(2,nil))),
inference(flattening,[],[f16]) ).
tff(f16,negated_conjecture,
( ~ 2 = length(cons(1,cons(2,nil))) ),
inference(negated_conjecture,[],[f15]) ).
tff(f15,conjecture,
2 = length(cons(1,cons(2,nil))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : DAT082_1 : TPTP v8.2.0. Released v6.1.0.
% 0.06/0.13 % 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.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 23:12:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TF0_THM_EQU_ARI problem
% 0.13/0.35 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.73/0.91 % (20794)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 (2994ds/51Mi)
% 0.73/0.91 % (20795)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.73/0.91 % (20799)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 (2994ds/83Mi)
% 0.73/0.91 % (20793)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 (2994ds/34Mi)
% 0.73/0.91 % (20797)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 (2994ds/34Mi)
% 0.73/0.91 % (20798)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.73/0.91 % (20796)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.73/0.91 % (20800)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 (2994ds/56Mi)
% 0.73/0.91 % (20796)Refutation not found, incomplete strategy% (20796)------------------------------
% 0.73/0.91 % (20796)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.91 % (20796)Termination reason: Refutation not found, incomplete strategy
% 0.73/0.91
% 0.73/0.91 % (20796)Memory used [KB]: 971
% 0.73/0.91 % (20796)Time elapsed: 0.004 s
% 0.73/0.91 % (20796)Instructions burned: 3 (million)
% 0.73/0.91 % (20793)Refutation not found, incomplete strategy% (20793)------------------------------
% 0.73/0.91 % (20793)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.91 % (20793)Termination reason: Refutation not found, incomplete strategy
% 0.73/0.91
% 0.73/0.91 % (20793)Memory used [KB]: 1055
% 0.73/0.91 % (20793)Time elapsed: 0.004 s
% 0.73/0.91 % (20793)Instructions burned: 4 (million)
% 0.73/0.91 % (20796)------------------------------
% 0.73/0.91 % (20796)------------------------------
% 0.73/0.91 % (20793)------------------------------
% 0.73/0.91 % (20793)------------------------------
% 0.73/0.91 % (20798)Also succeeded, but the first one will report.
% 0.73/0.91 % (20799)First to succeed.
% 0.73/0.91 % (20799)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-20792"
% 0.73/0.91 % (20799)Refutation found. Thanks to Tanya!
% 0.73/0.91 % SZS status Theorem for theBenchmark
% 0.73/0.91 % SZS output start Proof for theBenchmark
% See solution above
% 0.73/0.91 % (20799)------------------------------
% 0.73/0.91 % (20799)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.91 % (20799)Termination reason: Refutation
% 0.73/0.91
% 0.73/0.91 % (20799)Memory used [KB]: 1047
% 0.73/0.91 % (20799)Time elapsed: 0.005 s
% 0.73/0.91 % (20799)Instructions burned: 4 (million)
% 0.73/0.91 % (20792)Success in time 0.553 s
% 0.73/0.91 % Vampire---4.8 exiting
%------------------------------------------------------------------------------