TSTP Solution File: LCL762_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL762_5 : TPTP v8.2.0. Released v6.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/sandbox/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 : Tue May 21 00:22:41 EDT 2024
% Result : Theorem 0.52s 0.71s
% Output : Refutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 71
% Syntax : Number of formulae : 83 ( 9 unt; 68 typ; 0 def)
% Number of atoms : 32 ( 24 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 29 ( 12 ~; 9 |; 6 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 101 ( 55 >; 46 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 57 ( 57 usr; 6 con; 0-5 aty)
% Number of variables : 52 ( 18 !; 0 ?; 52 :)
% ( 34 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
dB: $tType ).
tff(type_def_7,type,
list: $tType > $tType ).
tff(type_def_8,type,
nat: $tType ).
tff(type_def_9,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_1,type,
it: fun(dB,bool) ).
tff(func_def_2,type,
beta: fun(dB,fun(dB,bool)) ).
tff(func_def_3,type,
abs: dB > dB ).
tff(func_def_4,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_5,type,
var: nat > dB ).
tff(func_def_6,type,
dB_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,X0)) * fun(dB,X0) * dB ) > X0 ) ).
tff(func_def_7,type,
dB_size: dB > nat ).
tff(func_def_8,type,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_9,type,
subst: ( dB * dB * nat ) > dB ).
tff(func_def_10,type,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_11,type,
step1:
!>[X0: $tType] : ( fun(X0,fun(X0,bool)) > fun(list(X0),fun(list(X0),bool)) ) ).
tff(func_def_12,type,
append:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_13,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_14,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_15,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_16,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_17,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_18,type,
list_rec:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),fun(X0,X0))) * list(X1) ) > X0 ) ).
tff(func_def_19,type,
list_size:
!>[X0: $tType] : ( ( fun(X0,nat) * list(X0) ) > nat ) ).
tff(func_def_20,type,
sublist:
!>[X0: $tType] : ( ( list(X0) * fun(nat,bool) ) > list(X0) ) ).
tff(func_def_21,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_22,type,
conversep:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,bool)) > fun(X1,fun(X0,bool)) ) ).
tff(func_def_23,type,
accp:
!>[X0: $tType] : ( fun(X0,fun(X0,bool)) > fun(X0,bool) ) ).
tff(func_def_24,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_25,type,
fFalse: bool ).
tff(func_def_26,type,
fTrue: bool ).
tff(func_def_27,type,
fequal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_28,type,
n: nat ).
tff(func_def_29,type,
sK3: dB > list(dB) ).
tff(func_def_30,type,
sK4: dB > dB ).
tff(func_def_31,type,
sK5: dB > dB ).
tff(func_def_32,type,
sK6: dB > nat ).
tff(func_def_33,type,
sK7: dB > dB ).
tff(func_def_34,type,
sK8: dB > dB ).
tff(func_def_35,type,
sK9: dB > dB ).
tff(func_def_36,type,
sK10: dB > nat ).
tff(func_def_37,type,
sK11:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_38,type,
sK12:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_39,type,
sK13:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(func_def_40,type,
sK14:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_41,type,
sK15: ( dB * dB ) > dB ).
tff(func_def_42,type,
sK16: ( dB * dB ) > dB ).
tff(func_def_43,type,
sK17: ( dB * dB ) > dB ).
tff(func_def_44,type,
sK18: ( dB * dB ) > dB ).
tff(func_def_45,type,
sK19: ( dB * dB ) > dB ).
tff(func_def_46,type,
sK20: ( dB * dB ) > dB ).
tff(func_def_47,type,
sK21: ( dB * dB ) > dB ).
tff(func_def_48,type,
sK22: ( dB * dB ) > dB ).
tff(func_def_49,type,
sK23: ( dB * dB ) > dB ).
tff(func_def_50,type,
sK24: ( dB * dB ) > dB ).
tff(func_def_51,type,
sK25: ( dB * dB * dB ) > dB ).
tff(func_def_52,type,
sK26: ( dB * dB * dB ) > dB ).
tff(func_def_53,type,
sK27: ( dB * dB * dB ) > dB ).
tff(func_def_54,type,
sK28: ( dB * dB ) > dB ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
list_ex1:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_3,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_4,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_5,type,
pp: bool > $o ).
tff(pred_def_6,type,
sP0: ( dB * dB ) > $o ).
tff(pred_def_7,type,
sP1: ( dB * dB ) > $o ).
tff(pred_def_8,type,
sP2: ( dB * dB ) > $o ).
tff(f322,plain,
$false,
inference(subsumption_resolution,[],[f321,f217]) ).
tff(f217,plain,
~ pp(aa(dB,bool,it,var(n))),
inference(cnf_transformation,[],[f108]) ).
tff(f108,plain,
~ pp(aa(dB,bool,it,var(n))),
inference(flattening,[],[f107]) ).
tff(f107,negated_conjecture,
~ pp(aa(dB,bool,it,var(n))),
inference(negated_conjecture,[],[f106]) ).
tff(f106,conjecture,
pp(aa(dB,bool,it,var(n))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).
tff(f321,plain,
pp(aa(dB,bool,it,var(n))),
inference(backward_demodulation,[],[f216,f304]) ).
tff(f304,plain,
! [X2: nat] : ( var(X2) = foldl(dB,dB,app,var(X2),nil(dB)) ),
inference(equality_resolution,[],[f303]) ).
tff(f303,plain,
! [X2: nat,X1: dB] :
( ( var(X2) = foldl(dB,dB,app,X1,nil(dB)) )
| ( var(X2) != X1 ) ),
inference(equality_resolution,[],[f240]) ).
tff(f240,plain,
! [X2: nat,X0: list(dB),X1: dB] :
( ( var(X2) = foldl(dB,dB,app,X1,X0) )
| ( nil(dB) != X0 )
| ( var(X2) != X1 ) ),
inference(cnf_transformation,[],[f181]) ).
tff(f181,plain,
! [X0: list(dB),X1: dB,X2: nat] :
( ( ( var(X2) = foldl(dB,dB,app,X1,X0) )
| ( nil(dB) != X0 )
| ( var(X2) != X1 ) )
& ( ( ( nil(dB) = X0 )
& ( var(X2) = X1 ) )
| ( var(X2) != foldl(dB,dB,app,X1,X0) ) ) ),
inference(flattening,[],[f180]) ).
tff(f180,plain,
! [X0: list(dB),X1: dB,X2: nat] :
( ( ( var(X2) = foldl(dB,dB,app,X1,X0) )
| ( nil(dB) != X0 )
| ( var(X2) != X1 ) )
& ( ( ( nil(dB) = X0 )
& ( var(X2) = X1 ) )
| ( var(X2) != foldl(dB,dB,app,X1,X0) ) ) ),
inference(nnf_transformation,[],[f123]) ).
tff(f123,plain,
! [X0: list(dB),X1: dB,X2: nat] :
( ( var(X2) = foldl(dB,dB,app,X1,X0) )
<=> ( ( nil(dB) = X0 )
& ( var(X2) = X1 ) ) ),
inference(rectify,[],[f1]) ).
tff(f1,axiom,
! [X3: list(dB),X4: dB,X5: nat] :
( ( var(X5) = foldl(dB,dB,app,X4,X3) )
<=> ( ( nil(dB) = X3 )
& ( var(X5) = X4 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_Var__eq__apps__conv) ).
tff(f216,plain,
pp(aa(dB,bool,it,foldl(dB,dB,app,var(n),nil(dB)))),
inference(cnf_transformation,[],[f105]) ).
tff(f105,axiom,
pp(aa(dB,bool,it,foldl(dB,dB,app,var(n),nil(dB)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : LCL762_5 : TPTP v8.2.0. Released v6.0.0.
% 0.00/0.09 % 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.08/0.29 % Computer : n012.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 300
% 0.08/0.29 % DateTime : Mon May 20 00:35:08 EDT 2024
% 0.08/0.29 % CPUTime :
% 0.08/0.29 This is a TF1_THM_EQU_NAR problem
% 0.08/0.29 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.52/0.70 % (25203)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.52/0.70 % (25197)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.52/0.70 % (25196)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.52/0.70 % (25198)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.52/0.70 % (25201)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.52/0.70 % (25200)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.52/0.70 % (25202)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.52/0.71 % (25202)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.52/0.71 % (25198)First to succeed.
% 0.52/0.71 % (25203)Refutation not found, incomplete strategy% (25203)------------------------------
% 0.52/0.71 % (25203)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.71 % (25203)Termination reason: Refutation not found, incomplete strategy
% 0.52/0.71
% 0.52/0.71 % (25203)Memory used [KB]: 1197
% 0.52/0.71 % (25203)Time elapsed: 0.006 s
% 0.52/0.71 % (25203)Instructions burned: 11 (million)
% 0.52/0.71 % (25203)------------------------------
% 0.52/0.71 % (25203)------------------------------
% 0.52/0.71 % (25198)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-25186"
% 0.52/0.71 % (25201)Also succeeded, but the first one will report.
% 0.52/0.71 % (25199)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.52/0.71 % (25198)Refutation found. Thanks to Tanya!
% 0.52/0.71 % SZS status Theorem for theBenchmark
% 0.52/0.71 % SZS output start Proof for theBenchmark
% See solution above
% 0.52/0.71 % (25198)------------------------------
% 0.52/0.71 % (25198)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.71 % (25198)Termination reason: Refutation
% 0.52/0.71
% 0.52/0.71 % (25198)Memory used [KB]: 1236
% 0.52/0.71 % (25198)Time elapsed: 0.006 s
% 0.52/0.71 % (25198)Instructions burned: 11 (million)
% 0.52/0.71 % (25186)Success in time 0.415 s
% 0.52/0.71 % Vampire---4.8 exiting
%------------------------------------------------------------------------------