TSTP Solution File: LCL771_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL771_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 : n017.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 : Wed May 1 03:20:00 EDT 2024
% Result : Theorem 0.54s 0.76s
% Output : Refutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 60
% Syntax : Number of formulae : 71 ( 6 unt; 57 typ; 0 def)
% Number of atoms : 64 ( 23 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 74 ( 24 ~; 23 |; 24 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 7 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 64 ( 36 >; 28 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-4 aty)
% Number of functors : 46 ( 46 usr; 12 con; 0-5 aty)
% Number of variables : 84 ( 34 !; 12 ?; 84 :)
% ( 38 !>; 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(fun(X0,X1),fun(fun(X2,X0),fun(X2,X1))) ).
tff(func_def_1,type,
combc:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * X1 ) > fun(X0,X2) ) ).
tff(func_def_2,type,
combi:
!>[X0: $tType] : fun(X0,X0) ).
tff(func_def_3,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * fun(X0,X1) ) > fun(X0,X2) ) ).
tff(func_def_4,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_5,type,
it: fun(dB,bool) ).
tff(func_def_6,type,
beta: fun(dB,fun(dB,bool)) ).
tff(func_def_7,type,
abs: dB > dB ).
tff(func_def_8,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_9,type,
var: nat > dB ).
tff(func_def_10,type,
dB_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,X0)) * fun(dB,X0) * dB ) > X0 ) ).
tff(func_def_11,type,
dB_size: dB > nat ).
tff(func_def_12,type,
lift: fun(dB,fun(nat,dB)) ).
tff(func_def_13,type,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_14,type,
subst: fun(dB,fun(dB,fun(nat,dB))) ).
tff(func_def_15,type,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_16,type,
concat:
!>[X0: $tType] : ( list(list(X0)) > list(X0) ) ).
tff(func_def_17,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_18,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_19,type,
cons:
!>[X0: $tType] : fun(X0,fun(list(X0),list(X0))) ).
tff(func_def_20,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_21,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_22,type,
list_rec:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),fun(X0,X0))) * list(X1) ) > X0 ) ).
tff(func_def_23,type,
list_size:
!>[X0: $tType] : ( ( fun(X0,nat) * list(X0) ) > nat ) ).
tff(func_def_24,type,
map:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > fun(list(X0),list(X1)) ) ).
tff(func_def_25,type,
sublist:
!>[X0: $tType] : ( ( list(X0) * fun(nat,bool) ) > list(X0) ) ).
tff(func_def_26,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_27,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_28,type,
fFalse: bool ).
tff(func_def_29,type,
fNot: fun(bool,bool) ).
tff(func_def_30,type,
fTrue: bool ).
tff(func_def_31,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_32,type,
fdisj: fun(bool,fun(bool,bool)) ).
tff(func_def_33,type,
fequal:
!>[X0: $tType] : ( X0 > fun(X0,bool) ) ).
tff(func_def_34,type,
i: nat ).
tff(func_def_35,type,
rs: list(dB) ).
tff(func_def_36,type,
sK1:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > X0 ) ).
tff(func_def_37,type,
sK2:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > list(X0) ) ).
tff(func_def_38,type,
sK3: dB > dB ).
tff(func_def_39,type,
sK4: dB > dB ).
tff(func_def_40,type,
sK5: dB > list(dB) ).
tff(func_def_41,type,
sK6: dB > dB ).
tff(func_def_42,type,
sK7: dB > list(dB) ).
tff(func_def_43,type,
sK8: dB > nat ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
step1:
!>[X0: $tType] : ( ( fun(X0,fun(X0,bool)) * list(X0) * list(X0) ) > $o ) ).
tff(pred_def_3,type,
list_all:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_4,type,
list_ex1:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_5,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_6,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_7,type,
pp: bool > $o ).
tff(pred_def_8,type,
sP0: dB > $o ).
tff(f223,plain,
$false,
inference(resolution,[],[f211,f170]) ).
tff(f170,plain,
~ listsp(dB,it,nil(dB)),
inference(cnf_transformation,[],[f120]) ).
tff(f120,plain,
~ listsp(dB,it,nil(dB)),
inference(flattening,[],[f119]) ).
tff(f119,negated_conjecture,
~ listsp(dB,it,nil(dB)),
inference(negated_conjecture,[],[f118]) ).
tff(f118,conjecture,
listsp(dB,it,nil(dB)),
file('/export/starexec/sandbox2/tmp/tmp.f9psRiSb1o/Vampire---4.8_8654',conj_1) ).
tff(f211,plain,
! [X0: $tType,X2: fun(X0,bool)] : listsp(X0,X2,nil(X0)),
inference(equality_resolution,[],[f178]) ).
tff(f178,plain,
! [X0: $tType,X2: fun(X0,bool),X1: list(X0)] :
( listsp(X0,X2,X1)
| ( nil(X0) != X1 ) ),
inference(cnf_transformation,[],[f150]) ).
tff(f150,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,sK2(X0,X1,X2))
& pp(aa(X0,bool,X2,sK1(X0,X1,X2)))
& ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),sK1(X0,X1,X2)),sK2(X0,X1,X2)) = X1 ) )
| ( nil(X0) = X1 )
| ~ listsp(X0,X2,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f148,f149]) ).
tff(f149,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,sK2(X0,X1,X2))
& pp(aa(X0,bool,X2,sK1(X0,X1,X2)))
& ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),sK1(X0,X1,X2)),sK2(X0,X1,X2)) = X1 ) ) ),
introduced(choice_axiom,[]) ).
tff(f148,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,[],[f147]) ).
tff(f147,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,[],[f146]) ).
tff(f146,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,[],[f125]) ).
tff(f125,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,[],[f85]) ).
tff(f85,axiom,
! [X0: $tType,X34: list(X0),X5: fun(X0,bool)] :
( listsp(X0,X5,X34)
<=> ( ? [X81: X0,X82: list(X0)] :
( listsp(X0,X5,X82)
& pp(aa(X0,bool,X5,X81))
& ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X81),X82) = X34 ) )
| ( nil(X0) = X34 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.f9psRiSb1o/Vampire---4.8_8654',fact_84_listsp_Osimps) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LCL771_5 : TPTP v8.1.2. Released v6.0.0.
% 0.10/0.12 % 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.11/0.33 % Computer : n017.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Tue Apr 30 16:15:19 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.11/0.33 This is a TF1_THM_EQU_NAR problem
% 0.11/0.33 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.f9psRiSb1o/Vampire---4.8_8654
% 0.54/0.75 % (8767)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.54/0.75 % (8765)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 (2995ds/34Mi)
% 0.54/0.75 % (8768)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.54/0.75 % (8771)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 (2995ds/83Mi)
% 0.54/0.75 % (8769)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 (2995ds/34Mi)
% 0.54/0.75 % (8770)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.54/0.75 % (8766)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 (2995ds/51Mi)
% 0.54/0.76 % (8772)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 (2995ds/56Mi)
% 0.54/0.76 % (8768)First to succeed.
% 0.54/0.76 % (8768)Refutation found. Thanks to Tanya!
% 0.54/0.76 % SZS status Theorem for Vampire---4
% 0.54/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.54/0.76 % (8768)------------------------------
% 0.54/0.76 % (8768)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.54/0.76 % (8768)Termination reason: Refutation
% 0.54/0.76
% 0.54/0.76 % (8768)Memory used [KB]: 1214
% 0.54/0.76 % (8768)Time elapsed: 0.008 s
% 0.54/0.76 % (8768)Instructions burned: 11 (million)
% 0.54/0.76 % (8768)------------------------------
% 0.54/0.76 % (8768)------------------------------
% 0.54/0.76 % (8761)Success in time 0.424 s
% 0.54/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------