TSTP Solution File: SCT229_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SCT229_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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n011.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:43:46 EDT 2024
% Result : Theorem 0.61s 0.76s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 62
% Syntax : Number of formulae : 68 ( 8 unt; 60 typ; 0 def)
% Number of atoms : 8 ( 7 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 1 ( 1 fml; 0 var)
% Number of types : 4 ( 3 usr)
% Number of type conns : 62 ( 44 >; 18 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-5 aty)
% Number of functors : 48 ( 48 usr; 10 con; 0-7 aty)
% Number of variables : 124 ( 0 !; 0 ?; 124 :)
% ( 124 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
arrow_411405190le_alt: $tType ).
tff(type_def_6,type,
arrow_159774573e_indi: $tType ).
tff(type_def_7,type,
bool: $tType ).
tff(type_def_8,type,
fun: ( $tType * $tType ) > $tType ).
tff(type_def_9,type,
product_prod: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
arrow_1985332922le_Lin: fun(fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool),bool) ).
tff(func_def_1,type,
arrow_610318064e_Prof: fun(fun(arrow_159774573e_indi,fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)),bool) ).
tff(func_def_2,type,
arrow_1158827142_above: ( fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool) * arrow_411405190le_alt * arrow_411405190le_alt ) > fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool) ).
tff(func_def_3,type,
arrow_319942042_below: ( fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool) * arrow_411405190le_alt * arrow_411405190le_alt ) > fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool) ).
tff(func_def_4,type,
arrow_276188178_mkbot: ( fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool) * arrow_411405190le_alt ) > fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool) ).
tff(func_def_5,type,
arrow_424895264_mktop: ( fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool) * arrow_411405190le_alt ) > fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool) ).
tff(func_def_6,type,
comp:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,X1) * fun(X2,X0) ) > fun(X2,X1) ) ).
tff(func_def_7,type,
product_Pair:
!>[X0: $tType,X1: $tType] : ( ( X0 * X1 ) > product_prod(X0,X1) ) ).
tff(func_def_8,type,
product_curry:
!>[X0: $tType,X1: $tType,X2: $tType] : ( fun(product_prod(X0,X1),X2) > fun(X0,fun(X1,X2)) ) ).
tff(func_def_9,type,
produc1605651328_split:
!>[X0: $tType,X1: $tType,X2: $tType] : fun(fun(X0,fun(X1,X2)),fun(product_prod(X0,X1),X2)) ).
tff(func_def_10,type,
product_prod_case:
!>[X0: $tType,X1: $tType,X2: $tType] : fun(fun(X0,fun(X1,X2)),fun(product_prod(X0,X1),X2)) ).
tff(func_def_11,type,
product_prod_rec:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * product_prod(X0,X1) ) > X2 ) ).
tff(func_def_12,type,
id_on:
!>[X0: $tType] : ( fun(X0,bool) > fun(product_prod(X0,X0),bool) ) ).
tff(func_def_13,type,
converse:
!>[X0: $tType,X1: $tType] : fun(fun(product_prod(X0,X1),bool),fun(product_prod(X1,X0),bool)) ).
tff(func_def_14,type,
inv_image:
!>[X0: $tType,X1: $tType] : ( ( fun(product_prod(X0,X0),bool) * fun(X1,X0) ) > fun(product_prod(X1,X1),bool) ) ).
tff(func_def_15,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_16,type,
fFalse: bool ).
tff(func_def_17,type,
fTrue: bool ).
tff(func_def_18,type,
f: fun(fun(arrow_159774573e_indi,fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)),fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)) ).
tff(func_def_19,type,
p: fun(arrow_159774573e_indi,fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)) ).
tff(func_def_20,type,
p1: fun(arrow_159774573e_indi,fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)) ).
tff(func_def_21,type,
a: arrow_411405190le_alt ).
tff(func_def_22,type,
b: arrow_411405190le_alt ).
tff(func_def_23,type,
c: arrow_411405190le_alt ).
tff(func_def_24,type,
sK0:
!>[X0: $tType,X1: $tType,X2: $tType,X3: $tType] : ( product_prod(X0,product_prod(X1,product_prod(X2,X3))) > X0 ) ).
tff(func_def_25,type,
sK1:
!>[X0: $tType,X1: $tType,X2: $tType,X3: $tType] : ( product_prod(X0,product_prod(X1,product_prod(X2,X3))) > X1 ) ).
tff(func_def_26,type,
sK2:
!>[X0: $tType,X1: $tType,X2: $tType,X3: $tType] : ( product_prod(X0,product_prod(X1,product_prod(X2,X3))) > X2 ) ).
tff(func_def_27,type,
sK3:
!>[X0: $tType,X1: $tType,X2: $tType,X3: $tType] : ( product_prod(X0,product_prod(X1,product_prod(X2,X3))) > X3 ) ).
tff(func_def_28,type,
sK4:
!>[X0: $tType,X1: $tType,X2: $tType,X3: $tType,X4: $tType] : ( product_prod(X0,product_prod(X1,product_prod(X2,product_prod(X3,X4)))) > X0 ) ).
tff(func_def_29,type,
sK5:
!>[X0: $tType,X1: $tType,X2: $tType,X3: $tType,X4: $tType] : ( product_prod(X0,product_prod(X1,product_prod(X2,product_prod(X3,X4)))) > X1 ) ).
tff(func_def_30,type,
sK6:
!>[X0: $tType,X1: $tType,X2: $tType,X3: $tType,X4: $tType] : ( product_prod(X0,product_prod(X1,product_prod(X2,product_prod(X3,X4)))) > X2 ) ).
tff(func_def_31,type,
sK7:
!>[X0: $tType,X1: $tType,X2: $tType,X3: $tType,X4: $tType] : ( product_prod(X0,product_prod(X1,product_prod(X2,product_prod(X3,X4)))) > X3 ) ).
tff(func_def_32,type,
sK8:
!>[X0: $tType,X1: $tType,X2: $tType,X3: $tType,X4: $tType] : ( product_prod(X0,product_prod(X1,product_prod(X2,product_prod(X3,X4)))) > X4 ) ).
tff(func_def_33,type,
sK9:
!>[X0: $tType,X1: $tType,X2: $tType,X3: $tType,X4: $tType,X5: $tType] : ( product_prod(X0,product_prod(X1,product_prod(X2,product_prod(X3,product_prod(X4,X5))))) > X0 ) ).
tff(func_def_34,type,
sK10:
!>[X0: $tType,X1: $tType,X2: $tType,X3: $tType,X4: $tType,X5: $tType] : ( product_prod(X0,product_prod(X1,product_prod(X2,product_prod(X3,product_prod(X4,X5))))) > X1 ) ).
tff(func_def_35,type,
sK11:
!>[X0: $tType,X1: $tType,X2: $tType,X3: $tType,X4: $tType,X5: $tType] : ( product_prod(X0,product_prod(X1,product_prod(X2,product_prod(X3,product_prod(X4,X5))))) > X2 ) ).
tff(func_def_36,type,
sK12:
!>[X0: $tType,X1: $tType,X2: $tType,X3: $tType,X4: $tType,X5: $tType] : ( product_prod(X0,product_prod(X1,product_prod(X2,product_prod(X3,product_prod(X4,X5))))) > X3 ) ).
tff(func_def_37,type,
sK13:
!>[X0: $tType,X1: $tType,X2: $tType,X3: $tType,X4: $tType,X5: $tType] : ( product_prod(X0,product_prod(X1,product_prod(X2,product_prod(X3,product_prod(X4,X5))))) > X4 ) ).
tff(func_def_38,type,
sK14:
!>[X0: $tType,X1: $tType,X2: $tType,X3: $tType,X4: $tType,X5: $tType] : ( product_prod(X0,product_prod(X1,product_prod(X2,product_prod(X3,product_prod(X4,X5))))) > X5 ) ).
tff(func_def_39,type,
sK15:
!>[X0: $tType,X1: $tType,X2: $tType] : ( product_prod(X0,product_prod(X1,X2)) > X0 ) ).
tff(func_def_40,type,
sK16:
!>[X0: $tType,X1: $tType,X2: $tType] : ( product_prod(X0,product_prod(X1,X2)) > X1 ) ).
tff(func_def_41,type,
sK17:
!>[X0: $tType,X1: $tType,X2: $tType] : ( product_prod(X0,product_prod(X1,X2)) > X2 ) ).
tff(func_def_42,type,
sK18:
!>[X0: $tType,X1: $tType] : ( product_prod(X0,X1) > X0 ) ).
tff(func_def_43,type,
sK19:
!>[X0: $tType,X1: $tType] : ( product_prod(X0,X1) > X1 ) ).
tff(func_def_44,type,
sK20:
!>[X0: $tType,X1: $tType] : ( product_prod(X0,X1) > X0 ) ).
tff(func_def_45,type,
sK21:
!>[X0: $tType,X1: $tType] : ( product_prod(X0,X1) > X1 ) ).
tff(pred_def_1,type,
arrow_1958449194le_IIA: fun(fun(arrow_159774573e_indi,fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)),fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)) > $o ).
tff(pred_def_2,type,
arrow_987702531ctator: ( fun(fun(arrow_159774573e_indi,fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)),fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)) * arrow_159774573e_indi ) > $o ).
tff(pred_def_3,type,
arrow_2069624013nimity: fun(fun(arrow_159774573e_indi,fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)),fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)) > $o ).
tff(pred_def_4,type,
in_rel:
!>[X0: $tType,X1: $tType] : ( ( fun(product_prod(X0,X1),bool) * X0 * X1 ) > $o ) ).
tff(pred_def_5,type,
antisym:
!>[X0: $tType] : ( fun(product_prod(X0,X0),bool) > $o ) ).
tff(pred_def_6,type,
irrefl:
!>[X0: $tType] : ( fun(product_prod(X0,X0),bool) > $o ) ).
tff(pred_def_7,type,
total_on:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(product_prod(X0,X0),bool) ) > $o ) ).
tff(pred_def_8,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_9,type,
pp: bool > $o ).
tff(f155,plain,
$false,
inference(trivial_inequality_removal,[],[f152]) ).
tff(f152,plain,
b != b,
inference(definition_unfolding,[],[f151,f139]) ).
tff(f139,plain,
a = b,
inference(cnf_transformation,[],[f109]) ).
tff(f109,plain,
a = b,
inference(flattening,[],[f108]) ).
tff(f108,negated_conjecture,
( ~ a != b ),
inference(negated_conjecture,[],[f107]) ).
tff(f107,conjecture,
a != b,
file('/export/starexec/sandbox/tmp/tmp.oTC4ys8rsl/Vampire---4.8_3567',conj_7) ).
tff(f151,plain,
a != b,
inference(cnf_transformation,[],[f3]) ).
tff(f3,axiom,
a != b,
file('/export/starexec/sandbox/tmp/tmp.oTC4ys8rsl/Vampire---4.8_3567',fact_2_A_I1_J) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SCT229_5 : TPTP v8.1.2. Released v6.0.0.
% 0.08/0.15 % 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.16/0.37 % Computer : n011.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Tue Apr 30 16:38:01 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a TF1_THM_EQU_NAR problem
% 0.16/0.37 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/tmp/tmp.oTC4ys8rsl/Vampire---4.8_3567
% 0.55/0.76 % (3806)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 (2996ds/83Mi)
% 0.55/0.76 % (3800)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 (2996ds/34Mi)
% 0.55/0.76 % (3806)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.55/0.76 % (3802)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.55/0.76 % (3801)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 (2996ds/51Mi)
% 0.55/0.76 % (3804)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 (2996ds/34Mi)
% 0.55/0.76 % (3805)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.55/0.76 % (3803)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.61/0.76 % (3806)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.61/0.76 % (3803)First to succeed.
% 0.61/0.76 % (3806)Also succeeded, but the first one will report.
% 0.61/0.76 % (3803)Refutation found. Thanks to Tanya!
% 0.61/0.76 % SZS status Theorem for Vampire---4
% 0.61/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.76 % (3803)------------------------------
% 0.61/0.76 % (3803)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.76 % (3803)Termination reason: Refutation
% 0.61/0.76
% 0.61/0.76 % (3803)Memory used [KB]: 1099
% 0.61/0.76 % (3803)Time elapsed: 0.004 s
% 0.61/0.76 % (3803)Instructions burned: 4 (million)
% 0.61/0.76 % (3803)------------------------------
% 0.61/0.76 % (3803)------------------------------
% 0.61/0.76 % (3796)Success in time 0.382 s
% 0.61/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------