TSTP Solution File: LCL829_5 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : LCL829_5 : TPTP v8.1.2. Released v6.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n014.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:54:08 EDT 2024

% Result   : Theorem 0.22s 0.55s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem    : LCL829_5 : TPTP v8.1.2. Released v6.0.0.
% 0.13/0.15  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36  % Computer : n014.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Fri May  3 13:26:02 EDT 2024
% 0.21/0.36  % CPUTime    : 
% 0.21/0.36  % (3119)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.39  % (3131)WARNING: value z3 for option sas not known
% 0.21/0.39  % (3132)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.21/0.39  % (3129)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.21/0.39  % (3130)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.21/0.39  % (3133)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.21/0.39  % (3134)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.21/0.39  % (3131)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.21/0.39  % Exception at run slice level
% 0.21/0.39  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.21/0.39  % (3135)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.21/0.40  % Exception at run slice level
% 0.21/0.40  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.21/0.40  % Exception at run slice level
% 0.21/0.40  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.21/0.40  % (3135)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.21/0.41  % (3141)fmb+10_1_fmbas=expand:fmbsr=1.1:gsp=on:nm=4_411 on theBenchmark for (411ds/0Mi)
% 0.21/0.42  % (3143)ott+1_9_av=off:bd=off:bs=on:gsp=on:lcm=predicate:nm=4:sp=weighted_frequency:urr=on_382 on theBenchmark for (382ds/0Mi)
% 0.21/0.42  % (3144)lrs-11_2:5_fsd=off:fde=none:nm=4:nwc=5.0:sims=off:sp=reverse_weighted_frequency:stl=62_367 on theBenchmark for (367ds/0Mi)
% 0.21/0.42  % (3141)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.21/0.42  % Exception at run slice level
% 0.21/0.42  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.21/0.43  % (3143)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.22/0.45  % (3161)ott+4_64_acc=on:anc=none:bs=on:bsr=on:fsd=off:gs=on:gsem=off:irw=on:msp=off:nwc=2.5:nicw=on:sims=off_354 on theBenchmark for (354ds/0Mi)
% 0.22/0.53  % (3144)First to succeed.
% 0.22/0.55  % (3144)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3119"
% 0.22/0.55  % (3144)Refutation found. Thanks to Tanya!
% 0.22/0.55  % SZS status Theorem for theBenchmark
% 0.22/0.55  % SZS output start Proof for theBenchmark
% 0.22/0.55  tff(type_def_5, type, bool: $tType).
% 0.22/0.55  tff(type_def_6, type, dB: $tType).
% 0.22/0.55  tff(type_def_7, type, list: $tType > $tType).
% 0.22/0.55  tff(type_def_8, type, nat: $tType).
% 0.22/0.55  tff(type_def_9, type, fun: ($tType * $tType) > $tType).
% 0.22/0.55  tff(func_def_0, type, combb: !>[X0: $tType, X1: $tType, X2: $tType]:((fun(X0,X1) * fun(X2,X0)) > fun(X2,X1))).
% 0.22/0.55  tff(func_def_1, type, combc: !>[X0: $tType, X1: $tType, X2: $tType]:((fun(X0,fun(X1,X2))) > fun(X1,fun(X0,X2)))).
% 0.22/0.55  tff(func_def_2, type, combi: !>[X0: $tType]:(fun(X0,X0))).
% 0.22/0.55  tff(func_def_3, type, combk: !>[X0: $tType, X1: $tType]:(fun(X0,fun(X1,X0)))).
% 0.22/0.55  tff(func_def_4, type, combs: !>[X0: $tType, X1: $tType, X2: $tType]:((fun(X0,fun(X1,X2)) * fun(X0,X1)) > fun(X0,X2))).
% 0.22/0.55  tff(func_def_5, type, n_lists: !>[X0: $tType]:((nat * list(X0)) > list(list(X0)))).
% 0.22/0.55  tff(func_def_6, type, zero_zero: !>[X0: $tType]:(X0)).
% 0.22/0.55  tff(func_def_7, type, it: fun(dB,bool)).
% 0.22/0.55  tff(func_def_8, type, var: nat > dB).
% 0.22/0.55  tff(func_def_9, type, dB_case: !>[X0: $tType]:((fun(nat,X0) * fun(dB,fun(dB,X0)) * fun(dB,X0) * dB) > X0)).
% 0.22/0.55  tff(func_def_10, type, dB_rec: !>[X0: $tType]:((fun(nat,X0) * fun(dB,fun(dB,fun(X0,fun(X0,X0)))) * fun(dB,fun(X0,X0)) * dB) > X0)).
% 0.22/0.55  tff(func_def_11, type, dB_size: dB > nat).
% 0.22/0.55  tff(func_def_12, type, lift: fun(dB,fun(nat,dB))).
% 0.22/0.55  tff(func_def_13, type, liftn: (nat * dB * nat) > dB).
% 0.22/0.55  tff(func_def_14, type, subst: fun(dB,fun(dB,fun(nat,dB)))).
% 0.22/0.55  tff(func_def_15, type, substn: (dB * dB * nat) > dB).
% 0.22/0.55  tff(func_def_16, type, concat: !>[X0: $tType]:((list(list(X0))) > list(X0))).
% 0.22/0.55  tff(func_def_17, type, filter: !>[X0: $tType]:((fun(X0,bool)) > fun(list(X0),list(X0)))).
% 0.22/0.55  tff(func_def_18, type, hd: !>[X0: $tType]:(fun(list(X0),X0))).
% 0.22/0.55  tff(func_def_19, type, insert: !>[X0: $tType]:((X0 * list(X0)) > list(X0))).
% 0.22/0.55  tff(func_def_20, type, cons: !>[X0: $tType]:(fun(X0,fun(list(X0),list(X0))))).
% 0.22/0.55  tff(func_def_21, type, nil: !>[X0: $tType]:(list(X0))).
% 0.22/0.55  tff(func_def_22, type, list_case: !>[X0: $tType, X1: $tType]:((X0 * fun(X1,fun(list(X1),X0))) > fun(list(X1),X0))).
% 0.22/0.55  tff(func_def_23, type, list_rec: !>[X0: $tType, X1: $tType]:((X0 * fun(X1,fun(list(X1),fun(X0,X0))) * list(X1)) > X0)).
% 0.22/0.55  tff(func_def_24, type, list_size: !>[X0: $tType]:((fun(X0,nat) * list(X0)) > nat)).
% 0.22/0.55  tff(func_def_25, type, map: !>[X0: $tType, X1: $tType]:(fun(fun(X0,X1),fun(list(X0),list(X1))))).
% 0.22/0.55  tff(func_def_26, type, maps: !>[X0: $tType, X1: $tType]:((fun(X0,list(X1)) * list(X0)) > list(X1))).
% 0.22/0.55  tff(func_def_27, type, monoid_add_listsum: !>[X0: $tType]:((list(X0)) > X0)).
% 0.22/0.55  tff(func_def_28, type, splice: !>[X0: $tType]:((list(X0) * list(X0)) > list(X0))).
% 0.22/0.55  tff(func_def_29, type, sublist: !>[X0: $tType]:((list(X0) * fun(nat,bool)) > list(X0))).
% 0.22/0.55  tff(func_def_30, type, tl: !>[X0: $tType]:(fun(list(X0),list(X0)))).
% 0.22/0.55  tff(func_def_31, type, transpose: !>[X0: $tType]:((list(list(X0))) > list(list(X0)))).
% 0.22/0.55  tff(func_def_32, type, transpose_rel: !>[X0: $tType]:(fun(list(list(X0)),fun(list(list(X0)),bool)))).
% 0.22/0.55  tff(func_def_33, type, suc: nat > nat).
% 0.22/0.55  tff(func_def_34, type, size_size: !>[X0: $tType]:((X0) > nat)).
% 0.22/0.55  tff(func_def_35, type, aa: !>[X0: $tType, X1: $tType]:((fun(X0,X1) * X0) > X1)).
% 0.22/0.55  tff(func_def_36, type, fFalse: bool).
% 0.22/0.55  tff(func_def_37, type, fNot: fun(bool,bool)).
% 0.22/0.55  tff(func_def_38, type, fTrue: bool).
% 0.22/0.55  tff(func_def_39, type, fconj: fun(bool,fun(bool,bool))).
% 0.22/0.55  tff(func_def_40, type, fequal: !>[X0: $tType]:(fun(X0,fun(X0,bool)))).
% 0.22/0.55  tff(func_def_41, type, a: dB).
% 0.22/0.55  tff(func_def_42, type, as: list(dB)).
% 0.22/0.55  tff(func_def_43, type, i: nat).
% 0.22/0.55  tff(func_def_44, type, n: nat).
% 0.22/0.55  tff(func_def_45, type, t: dB).
% 0.22/0.55  tff(func_def_46, type, u: dB).
% 0.22/0.55  tff(func_def_47, type, ua: dB).
% 0.22/0.55  tff(func_def_48, type, sK1: !>[X0: $tType]:((list(X0)) > X0)).
% 0.22/0.55  tff(func_def_49, type, sK2: !>[X0: $tType]:((list(X0)) > list(X0))).
% 0.22/0.55  tff(func_def_50, type, sK3: !>[X0: $tType]:((list(X0)) > X0)).
% 0.22/0.55  tff(func_def_51, type, sK4: !>[X0: $tType]:((list(X0)) > list(X0))).
% 0.22/0.55  tff(func_def_52, type, sK5: !>[X0: $tType]:((fun(X0,bool) * list(X0)) > X0)).
% 0.22/0.55  tff(func_def_53, type, sK6: !>[X0: $tType]:((fun(X0,bool) * list(X0)) > list(X0))).
% 0.22/0.55  tff(func_def_54, type, sK7: !>[X0: $tType, X1: $tType]:((fun(X1,X0) * fun(X1,X0)) > X1)).
% 0.22/0.55  tff(func_def_55, type, sK8: !>[X0: $tType, X1: $tType]:((list(X1) * fun(X1,X0) * list(X0) * X0) > X1)).
% 0.22/0.55  tff(func_def_56, type, sK9: !>[X0: $tType, X1: $tType]:((list(X1) * fun(X1,X0) * list(X0) * X0) > list(X1))).
% 0.22/0.55  tff(func_def_57, type, sK10: !>[X0: $tType, X1: $tType]:((list(X1) * X1 * list(X0) * fun(X0,X1)) > X0)).
% 0.22/0.55  tff(func_def_58, type, sK11: !>[X0: $tType, X1: $tType]:((list(X1) * X1 * list(X0) * fun(X0,X1)) > list(X0))).
% 0.22/0.55  tff(func_def_59, type, sK12: !>[X0: $tType, X1: $tType]:((list(X1) * fun(X1,X0) * list(X0) * X0) > X1)).
% 0.22/0.55  tff(func_def_60, type, sK13: !>[X0: $tType, X1: $tType]:((list(X1) * fun(X1,X0) * list(X0) * X0) > list(X1))).
% 0.22/0.55  tff(func_def_61, type, sK14: !>[X0: $tType, X1: $tType]:((list(X1) * X1 * list(X0) * fun(X0,X1)) > X0)).
% 0.22/0.55  tff(func_def_62, type, sK15: !>[X0: $tType, X1: $tType]:((list(X1) * X1 * list(X0) * fun(X0,X1)) > list(X0))).
% 0.22/0.55  tff(pred_def_1, type, zero: !>[X0: $tType]:($o)).
% 0.22/0.55  tff(pred_def_2, type, monoid_add: !>[X0: $tType]:($o)).
% 0.22/0.55  tff(pred_def_3, type, equal_equal: !>[X0: $tType]:((X0 * X0) > $o)).
% 0.22/0.55  tff(pred_def_4, type, listMem: !>[X0: $tType]:((X0 * list(X0)) > $o)).
% 0.22/0.55  tff(pred_def_5, type, listsp: !>[X0: $tType]:((fun(X0,bool) * list(X0)) > $o)).
% 0.22/0.55  tff(pred_def_6, type, member1: !>[X0: $tType]:((list(X0) * X0) > $o)).
% 0.22/0.55  tff(pred_def_7, type, null: !>[X0: $tType]:((list(X0)) > $o)).
% 0.22/0.55  tff(pred_def_8, type, accp: !>[X0: $tType]:((fun(X0,fun(X0,bool)) * X0) > $o)).
% 0.22/0.55  tff(pred_def_9, type, member: !>[X0: $tType]:((X0 * fun(X0,bool)) > $o)).
% 0.22/0.55  tff(pred_def_10, type, pp: bool > $o).
% 0.22/0.55  tff(pred_def_11, type, sP0: !>[X0: $tType]:((fun(X0,bool) * list(X0)) > $o)).
% 0.22/0.55  tff(f1003,plain,(
% 0.22/0.55    $false),
% 0.22/0.55    inference(subsumption_resolution,[],[f1002,f291])).
% 0.22/0.55  tff(f291,plain,(
% 0.22/0.55    pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),u),i)))),
% 0.22/0.55    inference(cnf_transformation,[],[f5])).
% 0.22/0.55  tff(f5,axiom,(
% 0.22/0.55    pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),u),i)))),
% 0.22/0.55    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_4__096IT_A_Ia_091u_Pi_093_J_096)).
% 0.22/0.55  tff(f1002,plain,(
% 0.22/0.55    ~pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),u),i)))),
% 0.22/0.55    inference(subsumption_resolution,[],[f988,f292])).
% 0.22/0.55  tff(f292,plain,(
% 0.22/0.55    listsp(dB,it,aa(list(dB),list(dB),aa(fun(dB,dB),fun(list(dB),list(dB)),map(dB,dB),aa(nat,fun(dB,dB),combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),combc(dB,dB,fun(nat,dB),subst),u)),i)),as))),
% 0.22/0.55    inference(cnf_transformation,[],[f6])).
% 0.22/0.55  tff(f6,axiom,(
% 0.22/0.55    listsp(dB,it,aa(list(dB),list(dB),aa(fun(dB,dB),fun(list(dB),list(dB)),map(dB,dB),aa(nat,fun(dB,dB),combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),combc(dB,dB,fun(nat,dB),subst),u)),i)),as))),
% 0.22/0.55    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_5_Cons_I3_J)).
% 0.22/0.55  tff(f988,plain,(
% 0.22/0.55    ~listsp(dB,it,aa(list(dB),list(dB),aa(fun(dB,dB),fun(list(dB),list(dB)),map(dB,dB),aa(nat,fun(dB,dB),combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),combc(dB,dB,fun(nat,dB),subst),u)),i)),as)) | ~pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),u),i)))),
% 0.22/0.55    inference(resolution,[],[f440,f483])).
% 0.22/0.55  tff(f483,plain,(
% 0.22/0.55    ~sP0(dB,it,aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),u),i)),aa(list(dB),list(dB),aa(fun(dB,dB),fun(list(dB),list(dB)),map(dB,dB),aa(nat,fun(dB,dB),combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),combc(dB,dB,fun(nat,dB),subst),u)),i)),as)))),
% 0.22/0.55    inference(resolution,[],[f282,f376])).
% 0.22/0.55  tff(f376,plain,(
% 0.22/0.55    ( ! [X0 : $tType,X2 : fun(X0,bool),X1 : list(X0)] : (listsp(X0,X2,X1) | ~sP0(X0,X2,X1)) )),
% 0.22/0.55    inference(cnf_transformation,[],[f258])).
% 0.22/0.55  tff(f258,plain,(
% 0.22/0.55    ! [X0 : $tType,X1 : list(X0),X2 : fun(X0,bool)] : ((listsp(X0,X2,X1) | ~sP0(X0,X2,X1)) & (sP0(X0,X2,X1) | ~listsp(X0,X2,X1)))),
% 0.22/0.55    inference(nnf_transformation,[],[f239])).
% 0.22/0.55  tff(f239,plain,(
% 0.22/0.55    ! [X0 : $tType,X1 : list(X0),X2 : fun(X0,bool)] : (listsp(X0,X2,X1) <=> sP0(X0,X2,X1))),
% 0.22/0.55    inference(definition_folding,[],[f183,f238])).
% 0.22/0.55  tff(f238,plain,(
% 0.22/0.55    ! [X2 : fun(X0,bool),X0 : $tType,X1 : list(X0)] : (sP0(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))),
% 0.22/0.55    introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])])).
% 0.22/0.55  tff(f183,plain,(
% 0.22/0.55    ! [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))),
% 0.22/0.55    inference(rectify,[],[f56])).
% 0.22/0.55  tff(f56,axiom,(
% 0.22/0.55    ! [X0 : $tType,X13 : list(X0),X8 : fun(X0,bool)] : (listsp(X0,X8,X13) <=> (? [X43 : X0,X44 : list(X0)] : (listsp(X0,X8,X44) & pp(aa(X0,bool,X8,X43)) & aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X43),X44) = X13) | nil(X0) = X13))),
% 0.22/0.55    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_55_listsp_Osimps)).
% 0.22/0.55  tff(f282,plain,(
% 0.22/0.55    ~listsp(dB,it,aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),u),i)),aa(list(dB),list(dB),aa(fun(dB,dB),fun(list(dB),list(dB)),map(dB,dB),aa(nat,fun(dB,dB),combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),combc(dB,dB,fun(nat,dB),subst),u)),i)),as)))),
% 0.22/0.55    inference(cnf_transformation,[],[f118])).
% 0.22/0.55  tff(f118,plain,(
% 0.22/0.55    ~listsp(dB,it,aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),u),i)),aa(list(dB),list(dB),aa(fun(dB,dB),fun(list(dB),list(dB)),map(dB,dB),aa(nat,fun(dB,dB),combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),combc(dB,dB,fun(nat,dB),subst),u)),i)),as)))),
% 0.22/0.55    inference(flattening,[],[f117])).
% 0.22/0.55  tff(f117,negated_conjecture,(
% 0.22/0.55    ~listsp(dB,it,aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),u),i)),aa(list(dB),list(dB),aa(fun(dB,dB),fun(list(dB),list(dB)),map(dB,dB),aa(nat,fun(dB,dB),combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),combc(dB,dB,fun(nat,dB),subst),u)),i)),as)))),
% 0.22/0.55    inference(negated_conjecture,[],[f116])).
% 0.22/0.55  tff(f116,conjecture,(
% 0.22/0.55    listsp(dB,it,aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),u),i)),aa(list(dB),list(dB),aa(fun(dB,dB),fun(list(dB),list(dB)),map(dB,dB),aa(nat,fun(dB,dB),combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),combc(dB,dB,fun(nat,dB),subst),u)),i)),as)))),
% 0.22/0.55    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0)).
% 0.22/0.55  tff(f440,plain,(
% 0.22/0.55    ( ! [X1 : $tType,X3 : X1,X0 : fun(X1,bool),X4 : list(X1)] : (sP0(X1,X0,aa(list(X1),list(X1),aa(X1,fun(list(X1),list(X1)),cons(X1),X3),X4)) | ~listsp(X1,X0,X4) | ~pp(aa(X1,bool,X0,X3))) )),
% 0.22/0.55    inference(equality_resolution,[],[f374])).
% 0.22/0.55  tff(f374,plain,(
% 0.22/0.55    ( ! [X1 : $tType,X2 : list(X1),X3 : X1,X0 : fun(X1,bool),X4 : list(X1)] : (sP0(X1,X0,X2) | ~listsp(X1,X0,X4) | ~pp(aa(X1,bool,X0,X3)) | aa(list(X1),list(X1),aa(X1,fun(list(X1),list(X1)),cons(X1),X3),X4) != X2) )),
% 0.22/0.55    inference(cnf_transformation,[],[f257])).
% 0.22/0.55  tff(f257,plain,(
% 0.22/0.55    ! [X0 : fun(X1,bool),X1 : $tType,X2 : list(X1)] : ((sP0(X1,X0,X2) | (! [X3 : X1,X4 : list(X1)] : (~listsp(X1,X0,X4) | ~pp(aa(X1,bool,X0,X3)) | aa(list(X1),list(X1),aa(X1,fun(list(X1),list(X1)),cons(X1),X3),X4) != X2) & nil(X1) != X2)) & ((listsp(X1,X0,sK6(X1,X0,X2)) & pp(aa(X1,bool,X0,sK5(X1,X0,X2))) & aa(list(X1),list(X1),aa(X1,fun(list(X1),list(X1)),cons(X1),sK5(X1,X0,X2)),sK6(X1,X0,X2)) = X2) | nil(X1) = X2 | ~sP0(X1,X0,X2)))),
% 0.22/0.55    inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6])],[f255,f256])).
% 0.22/0.55  tff(f256,plain,(
% 0.22/0.55    ! [X1 : $tType,X0 : fun(X1,bool),X2 : list(X1)] : (? [X5 : X1,X6 : list(X1)] : (listsp(X1,X0,X6) & pp(aa(X1,bool,X0,X5)) & aa(list(X1),list(X1),aa(X1,fun(list(X1),list(X1)),cons(X1),X5),X6) = X2) => (listsp(X1,X0,sK6(X1,X0,X2)) & pp(aa(X1,bool,X0,sK5(X1,X0,X2))) & aa(list(X1),list(X1),aa(X1,fun(list(X1),list(X1)),cons(X1),sK5(X1,X0,X2)),sK6(X1,X0,X2)) = X2))),
% 0.22/0.55    introduced(choice_axiom,[])).
% 0.22/0.55  tff(f255,plain,(
% 0.22/0.55    ! [X0 : fun(X1,bool),X1 : $tType,X2 : list(X1)] : ((sP0(X1,X0,X2) | (! [X3 : X1,X4 : list(X1)] : (~listsp(X1,X0,X4) | ~pp(aa(X1,bool,X0,X3)) | aa(list(X1),list(X1),aa(X1,fun(list(X1),list(X1)),cons(X1),X3),X4) != X2) & nil(X1) != X2)) & (? [X5 : X1,X6 : list(X1)] : (listsp(X1,X0,X6) & pp(aa(X1,bool,X0,X5)) & aa(list(X1),list(X1),aa(X1,fun(list(X1),list(X1)),cons(X1),X5),X6) = X2) | nil(X1) = X2 | ~sP0(X1,X0,X2)))),
% 0.22/0.55    inference(rectify,[],[f254])).
% 0.22/0.55  tff(f254,plain,(
% 0.22/0.55    ! [X2 : fun(X0,bool),X0 : $tType,X1 : list(X0)] : ((sP0(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 | ~sP0(X0,X2,X1)))),
% 0.22/0.55    inference(flattening,[],[f253])).
% 0.22/0.55  tff(f253,plain,(
% 0.22/0.55    ! [X2 : fun(X0,bool),X0 : $tType,X1 : list(X0)] : ((sP0(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) | ~sP0(X0,X2,X1)))),
% 0.22/0.55    inference(nnf_transformation,[],[f238])).
% 0.22/0.55  % SZS output end Proof for theBenchmark
% 0.22/0.55  % (3144)------------------------------
% 0.22/0.55  % (3144)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.55  % (3144)Termination reason: Refutation
% 0.22/0.55  
% 0.22/0.55  % (3144)Memory used [KB]: 1857
% 0.22/0.55  % (3144)Time elapsed: 0.119 s
% 0.22/0.55  % (3144)Instructions burned: 133 (million)
% 0.22/0.55  % (3119)Success in time 0.181 s
%------------------------------------------------------------------------------