TSTP Solution File: LCL769_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL769_5 : TPTP v8.1.2. 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n007.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 : Sun May 5 07:42:20 EDT 2024
% Result : Theorem 0.77s 0.94s
% Output : Refutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 75
% Syntax : Number of formulae : 92 ( 12 unt; 70 typ; 0 def)
% Number of atoms : 77 ( 23 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 86 ( 31 ~; 28 |; 24 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 88 ( 55 >; 33 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 62 ( 62 usr; 9 con; 0-5 aty)
% Number of variables : 117 ( 47 !; 12 ?; 117 :)
% ( 58 !>; 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,
combb:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,X1) * fun(X2,X0) ) > fun(X2,X1) ) ).
tff(func_def_1,type,
combc:
!>[X0: $tType,X1: $tType,X2: $tType] : ( fun(X0,fun(X1,X2)) > fun(X1,fun(X0,X2)) ) ).
tff(func_def_2,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * fun(X0,X1) ) > fun(X0,X2) ) ).
tff(func_def_3,type,
it: fun(dB,bool) ).
tff(func_def_4,type,
abs: dB > dB ).
tff(func_def_5,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_6,type,
var: nat > dB ).
tff(func_def_7,type,
dB_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,X0)) * fun(dB,X0) * dB ) > X0 ) ).
tff(func_def_8,type,
append:
!>[X0: $tType] : fun(list(X0),fun(list(X0),list(X0))) ).
tff(func_def_9,type,
butlast:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_10,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_11,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_12,type,
last:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_13,type,
cons:
!>[X0: $tType] : fun(X0,fun(list(X0),list(X0))) ).
tff(func_def_14,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_15,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_16,type,
maps:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,list(X1)) * list(X0) ) > list(X1) ) ).
tff(func_def_17,type,
rev:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_18,type,
rotate1:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_19,type,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_20,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_21,type,
fFalse: bool ).
tff(func_def_22,type,
fNot: fun(bool,bool) ).
tff(func_def_23,type,
fTrue: bool ).
tff(func_def_24,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_25,type,
fdisj: fun(bool,fun(bool,bool)) ).
tff(func_def_26,type,
fequal:
!>[X0: $tType] : ( X0 > fun(X0,bool) ) ).
tff(func_def_27,type,
i: nat ).
tff(func_def_28,type,
rs: list(dB) ).
tff(func_def_29,type,
sK0:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > X0 ) ).
tff(func_def_30,type,
sK1:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > list(X0) ) ).
tff(func_def_31,type,
sK2:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_32,type,
sK3:
!>[X0: $tType] : ( fun(list(X0),bool) > list(X0) ) ).
tff(func_def_33,type,
sK4:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_34,type,
sK5:
!>[X0: $tType] : ( fun(list(X0),bool) > list(X0) ) ).
tff(func_def_35,type,
sK6:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_36,type,
sK7:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_37,type,
sK8:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_38,type,
sK9:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_39,type,
sK10:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_40,type,
sK11:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_41,type,
sK12:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_42,type,
sK13:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * X0 ) > list(X0) ) ).
tff(func_def_43,type,
sK14:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_44,type,
sK15:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_45,type,
sK16:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_46,type,
sK17:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_47,type,
sK18:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_48,type,
sK19: dB > list(dB) ).
tff(func_def_49,type,
sK20: dB > dB ).
tff(func_def_50,type,
sK21: dB > dB ).
tff(func_def_51,type,
sK22: dB > nat ).
tff(func_def_52,type,
sK23: dB > dB ).
tff(func_def_53,type,
sK24: dB > dB ).
tff(func_def_54,type,
sK25: dB > dB ).
tff(func_def_55,type,
sK26: dB > nat ).
tff(func_def_56,type,
sK27: ( list(dB) * dB * dB * dB ) > list(dB) ).
tff(func_def_57,type,
sK28:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_58,type,
sK29:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_59,type,
sK30:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(pred_def_1,type,
list_all:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $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,
pp: bool > $o ).
tff(pred_def_5,type,
sQ31_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f615,plain,
$false,
inference(subsumption_resolution,[],[f614,f310]) ).
tff(f310,plain,
! [X0: nat] : pp(aa(dB,bool,it,var(X0))),
inference(cnf_transformation,[],[f128]) ).
tff(f128,plain,
! [X0: nat] : pp(aa(dB,bool,it,var(X0))),
inference(rectify,[],[f1]) ).
tff(f1,axiom,
! [X4: nat] : pp(aa(dB,bool,it,var(X4))),
file('/export/starexec/sandbox2/tmp/tmp.9SJIDAOPGk/Vampire---4.8_3485',fact_0_Var__IT) ).
tff(f614,plain,
~ pp(aa(dB,bool,it,var(i))),
inference(subsumption_resolution,[],[f613,f307]) ).
tff(f307,plain,
! [X0: $tType,X1: fun(X0,bool)] : listsp(X0,X1,nil(X0)),
inference(cnf_transformation,[],[f125]) ).
tff(f125,plain,
! [X0: $tType,X1: fun(X0,bool)] : listsp(X0,X1,nil(X0)),
inference(rectify,[],[f2]) ).
tff(f2,axiom,
! [X2: $tType,X5: fun(X2,bool)] : listsp(X2,X5,nil(X2)),
file('/export/starexec/sandbox2/tmp/tmp.9SJIDAOPGk/Vampire---4.8_3485',fact_1_listsp_ONil) ).
tff(f613,plain,
( ~ listsp(dB,it,nil(dB))
| ~ pp(aa(dB,bool,it,var(i))) ),
inference(resolution,[],[f295,f432]) ).
tff(f432,plain,
! [X0: $tType,X2: fun(X0,bool),X3: X0,X4: list(X0)] :
( listsp(X0,X2,aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4))
| ~ listsp(X0,X2,X4)
| ~ pp(aa(X0,bool,X2,X3)) ),
inference(equality_resolution,[],[f306]) ).
tff(f306,plain,
! [X0: $tType,X2: fun(X0,bool),X3: X0,X1: list(X0),X4: list(X0)] :
( listsp(X0,X2,X1)
| ~ listsp(X0,X2,X4)
| ~ pp(aa(X0,bool,X2,X3))
| ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) != X1 ) ),
inference(cnf_transformation,[],[f214]) ).
tff(f214,plain,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( ( listsp(X0,X2,X1)
| ( ! [X3: X0,X4: list(X0)] :
( ~ listsp(X0,X2,X4)
| ~ pp(aa(X0,bool,X2,X3))
| ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) != X1 ) )
& ( nil(X0) != X1 ) ) )
& ( ( listsp(X0,X2,sK1(X0,X1,X2))
& pp(aa(X0,bool,X2,sK0(X0,X1,X2)))
& ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),sK0(X0,X1,X2)),sK1(X0,X1,X2)) = X1 ) )
| ( nil(X0) = X1 )
| ~ listsp(X0,X2,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f212,f213]) ).
tff(f213,plain,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( ? [X5: X0,X6: list(X0)] :
( listsp(X0,X2,X6)
& pp(aa(X0,bool,X2,X5))
& ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X5),X6) = X1 ) )
=> ( listsp(X0,X2,sK1(X0,X1,X2))
& pp(aa(X0,bool,X2,sK0(X0,X1,X2)))
& ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),sK0(X0,X1,X2)),sK1(X0,X1,X2)) = X1 ) ) ),
introduced(choice_axiom,[]) ).
tff(f212,plain,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( ( listsp(X0,X2,X1)
| ( ! [X3: X0,X4: list(X0)] :
( ~ listsp(X0,X2,X4)
| ~ pp(aa(X0,bool,X2,X3))
| ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) != X1 ) )
& ( nil(X0) != X1 ) ) )
& ( ? [X5: X0,X6: list(X0)] :
( listsp(X0,X2,X6)
& pp(aa(X0,bool,X2,X5))
& ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X5),X6) = X1 ) )
| ( nil(X0) = X1 )
| ~ listsp(X0,X2,X1) ) ),
inference(rectify,[],[f211]) ).
tff(f211,plain,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( ( listsp(X0,X2,X1)
| ( ! [X3: X0,X4: list(X0)] :
( ~ listsp(X0,X2,X4)
| ~ pp(aa(X0,bool,X2,X3))
| ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) != X1 ) )
& ( nil(X0) != X1 ) ) )
& ( ? [X3: X0,X4: list(X0)] :
( listsp(X0,X2,X4)
& pp(aa(X0,bool,X2,X3))
& ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) = X1 ) )
| ( nil(X0) = X1 )
| ~ listsp(X0,X2,X1) ) ),
inference(flattening,[],[f210]) ).
tff(f210,plain,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( ( listsp(X0,X2,X1)
| ( ! [X3: X0,X4: list(X0)] :
( ~ listsp(X0,X2,X4)
| ~ pp(aa(X0,bool,X2,X3))
| ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) != X1 ) )
& ( nil(X0) != X1 ) ) )
& ( ? [X3: X0,X4: list(X0)] :
( listsp(X0,X2,X4)
& pp(aa(X0,bool,X2,X3))
& ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) = X1 ) )
| ( nil(X0) = X1 )
| ~ listsp(X0,X2,X1) ) ),
inference(nnf_transformation,[],[f124]) ).
tff(f124,plain,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( listsp(X0,X2,X1)
<=> ( ? [X3: X0,X4: list(X0)] :
( listsp(X0,X2,X4)
& pp(aa(X0,bool,X2,X3))
& ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) = X1 ) )
| ( nil(X0) = X1 ) ) ),
inference(rectify,[],[f11]) ).
tff(f11,axiom,
! [X2: $tType,X17: list(X2),X5: fun(X2,bool)] :
( listsp(X2,X5,X17)
<=> ( ? [X23: X2,X24: list(X2)] :
( listsp(X2,X5,X24)
& pp(aa(X2,bool,X5,X23))
& ( aa(list(X2),list(X2),aa(X2,fun(list(X2),list(X2)),cons(X2),X23),X24) = X17 ) )
| ( nil(X2) = X17 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.9SJIDAOPGk/Vampire---4.8_3485',fact_10_listsp_Osimps) ).
tff(f295,plain,
~ listsp(dB,it,aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),var(i)),nil(dB))),
inference(cnf_transformation,[],[f119]) ).
tff(f119,plain,
~ listsp(dB,it,aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),var(i)),nil(dB))),
inference(flattening,[],[f118]) ).
tff(f118,negated_conjecture,
~ listsp(dB,it,aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),var(i)),nil(dB))),
inference(negated_conjecture,[],[f117]) ).
tff(f117,conjecture,
listsp(dB,it,aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),var(i)),nil(dB))),
file('/export/starexec/sandbox2/tmp/tmp.9SJIDAOPGk/Vampire---4.8_3485',conj_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL769_5 : TPTP v8.1.2. Released v6.0.0.
% 0.14/0.15 % 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.16/0.35 % Computer : n007.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 13:19:05 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a TF1_THM_EQU_NAR problem
% 0.16/0.36 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/tmp/tmp.9SJIDAOPGk/Vampire---4.8_3485
% 0.77/0.93 % (3708)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2994ds/33Mi)
% 0.77/0.93 % (3705)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 Vampire---4 for (2994ds/34Mi)
% 0.77/0.93 % (3707)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2994ds/78Mi)
% 0.77/0.93 % (3709)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 Vampire---4 for (2994ds/34Mi)
% 0.77/0.93 % (3706)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 Vampire---4 for (2994ds/51Mi)
% 0.77/0.93 % (3710)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2994ds/45Mi)
% 0.77/0.93 % (3711)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 Vampire---4 for (2994ds/83Mi)
% 0.77/0.93 % (3712)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2994ds/56Mi)
% 0.77/0.93 % (3711)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.77/0.93 % (3711)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.77/0.94 % (3712)First to succeed.
% 0.77/0.94 % (3710)Refutation not found, incomplete strategy% (3710)------------------------------
% 0.77/0.94 % (3710)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.77/0.94 % (3710)Termination reason: Refutation not found, incomplete strategy
% 0.77/0.94
% 0.77/0.94 % (3710)Memory used [KB]: 1308
% 0.77/0.94 % (3710)Time elapsed: 0.013 s
% 0.77/0.94 % (3710)Instructions burned: 22 (million)
% 0.77/0.94 % (3710)------------------------------
% 0.77/0.94 % (3710)------------------------------
% 0.77/0.94 % (3712)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3646"
% 0.77/0.94 % (3712)Refutation found. Thanks to Tanya!
% 0.77/0.94 % SZS status Theorem for Vampire---4
% 0.77/0.94 % SZS output start Proof for Vampire---4
% See solution above
% 0.77/0.94 % (3712)------------------------------
% 0.77/0.94 % (3712)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.77/0.94 % (3712)Termination reason: Refutation
% 0.77/0.94
% 0.77/0.94 % (3712)Memory used [KB]: 1327
% 0.77/0.94 % (3712)Time elapsed: 0.014 s
% 0.77/0.94 % (3712)Instructions burned: 24 (million)
% 0.77/0.94 % (3646)Success in time 0.572 s
% 0.77/0.94 % Vampire---4.8 exiting
%------------------------------------------------------------------------------