TSTP Solution File: SCT179_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SCT179_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 : n019.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 08:59:49 EDT 2024
% Result : Theorem 0.60s 0.81s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 53
% Syntax : Number of formulae : 62 ( 8 unt; 50 typ; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 2 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 49 ( 30 >; 19 *; 0 +; 0 <<)
% Number of predicates : 20 ( 19 usr; 1 prp; 0-6 aty)
% Number of functors : 28 ( 28 usr; 6 con; 0-5 aty)
% Number of variables : 68 ( 14 !; 3 ?; 68 :)
% ( 51 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
arrow_411405190le_alt: $tType ).
tff(type_def_6,type,
bool: $tType ).
tff(type_def_7,type,
nat: $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,
combb:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,X1) * fun(X2,X0) ) > fun(X2,X1) ) ).
tff(func_def_2,type,
combc:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * X1 ) > fun(X0,X2) ) ).
tff(func_def_3,type,
combk:
!>[X0: $tType,X1: $tType] : ( X0 > fun(X1,X0) ) ).
tff(func_def_4,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * fun(X0,X1) ) > fun(X0,X2) ) ).
tff(func_def_5,type,
minus_minus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_6,type,
order_215145569der_on:
!>[X0: $tType] : ( fun(X0,bool) > fun(fun(product_prod(X0,X0),bool),bool) ) ).
tff(func_def_7,type,
bot_bot:
!>[X0: $tType] : X0 ).
tff(func_def_8,type,
top_top:
!>[X0: $tType] : X0 ).
tff(func_def_9,type,
domain:
!>[X0: $tType,X1: $tType] : ( fun(product_prod(X0,X1),bool) > fun(X0,bool) ) ).
tff(func_def_10,type,
id:
!>[X0: $tType] : fun(product_prod(X0,X0),bool) ).
tff(func_def_11,type,
id_on:
!>[X0: $tType] : ( fun(X0,bool) > fun(product_prod(X0,X0),bool) ) ).
tff(func_def_12,type,
range:
!>[X0: $tType,X1: $tType] : ( fun(product_prod(X0,X1),bool) > fun(X1,bool) ) ).
tff(func_def_13,type,
collect:
!>[X0: $tType] : ( fun(X0,bool) > fun(X0,bool) ) ).
tff(func_def_14,type,
lex_prod:
!>[X0: $tType,X1: $tType] : ( ( fun(product_prod(X0,X0),bool) * fun(product_prod(X1,X1),bool) ) > fun(product_prod(product_prod(X0,X1),product_prod(X0,X1)),bool) ) ).
tff(func_def_15,type,
measure:
!>[X0: $tType] : ( fun(X0,nat) > fun(product_prod(X0,X0),bool) ) ).
tff(func_def_16,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_17,type,
fFalse: bool ).
tff(func_def_18,type,
fNot: fun(bool,bool) ).
tff(func_def_19,type,
fTrue: bool ).
tff(func_def_20,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_21,type,
member:
!>[X0: $tType] : fun(X0,fun(fun(X0,bool),bool)) ).
tff(func_def_22,type,
r: fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool) ).
tff(func_def_23,type,
sK0:
!>[X0: $tType] : X0 ).
tff(func_def_24,type,
sK1:
!>[X0: $tType] : ( fun(X0,bool) > X0 ) ).
tff(func_def_25,type,
sK2:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(pred_def_1,type,
cl_Groups_Ominus:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
bot:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
top:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
group_add:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
preorder:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
ordered_ab_group_add:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
order_1409979114der_on:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(product_prod(X0,X0),bool) ) > $o ) ).
tff(pred_def_8,type,
order_915043626der_on:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(product_prod(X0,X0),bool) ) > $o ) ).
tff(pred_def_9,type,
order_preorder_on:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(product_prod(X0,X0),bool) ) > $o ) ).
tff(pred_def_10,type,
order_well_order_on:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(product_prod(X0,X0),bool) ) > $o ) ).
tff(pred_def_11,type,
ord_less_eq:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_12,type,
inv_imagep:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X0,bool)) * fun(X1,X0) * X1 * X1 ) > $o ) ).
tff(pred_def_13,type,
antisym:
!>[X0: $tType] : ( fun(product_prod(X0,X0),bool) > $o ) ).
tff(pred_def_14,type,
irrefl:
!>[X0: $tType] : ( fun(product_prod(X0,X0),bool) > $o ) ).
tff(pred_def_15,type,
refl_on:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(product_prod(X0,X0),bool) ) > $o ) ).
tff(pred_def_16,type,
total_on:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(product_prod(X0,X0),bool) ) > $o ) ).
tff(pred_def_17,type,
trans:
!>[X0: $tType] : ( fun(product_prod(X0,X0),bool) > $o ) ).
tff(pred_def_18,type,
wf:
!>[X0: $tType] : ( fun(product_prod(X0,X0),bool) > $o ) ).
tff(pred_def_19,type,
pp: bool > $o ).
tff(f184,plain,
$false,
inference(unit_resulting_resolution,[],[f161,f162,f179]) ).
tff(f179,plain,
! [X0: $tType,X2: fun(X0,bool),X1: fun(product_prod(X0,X0),bool)] :
( pp(aa(fun(product_prod(X0,X0),bool),bool,order_215145569der_on(X0,X2),minus_minus(fun(product_prod(X0,X0),bool),X1,id(X0))))
| ~ order_1409979114der_on(X0,X2,X1) ),
inference(cnf_transformation,[],[f153]) ).
tff(f153,plain,
! [X0: $tType,X1: fun(product_prod(X0,X0),bool),X2: fun(X0,bool)] :
( pp(aa(fun(product_prod(X0,X0),bool),bool,order_215145569der_on(X0,X2),minus_minus(fun(product_prod(X0,X0),bool),X1,id(X0))))
| ~ order_1409979114der_on(X0,X2,X1) ),
inference(ennf_transformation,[],[f143]) ).
tff(f143,plain,
! [X0: $tType,X1: fun(product_prod(X0,X0),bool),X2: fun(X0,bool)] :
( order_1409979114der_on(X0,X2,X1)
=> pp(aa(fun(product_prod(X0,X0),bool),bool,order_215145569der_on(X0,X2),minus_minus(fun(product_prod(X0,X0),bool),X1,id(X0)))) ),
inference(rectify,[],[f1]) ).
tff(f1,axiom,
! [X0: $tType,X3: fun(product_prod(X0,X0),bool),X4: fun(X0,bool)] :
( order_1409979114der_on(X0,X4,X3)
=> pp(aa(fun(product_prod(X0,X0),bool),bool,order_215145569der_on(X0,X4),minus_minus(fun(product_prod(X0,X0),bool),X3,id(X0)))) ),
file('/export/starexec/sandbox2/tmp/tmp.LLqbWqWBJN/Vampire---4.8_25449',fact_0_strict__linear__order__on__diff__Id) ).
tff(f162,plain,
! [X0: fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)] : ~ pp(aa(fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool),bool,order_215145569der_on(arrow_411405190le_alt,top_top(fun(arrow_411405190le_alt,bool))),X0)),
inference(cnf_transformation,[],[f147]) ).
tff(f147,plain,
! [X0: fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)] : ~ pp(aa(fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool),bool,order_215145569der_on(arrow_411405190le_alt,top_top(fun(arrow_411405190le_alt,bool))),X0)),
inference(ennf_transformation,[],[f128]) ).
tff(f128,plain,
~ ? [X0: fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)] : pp(aa(fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool),bool,order_215145569der_on(arrow_411405190le_alt,top_top(fun(arrow_411405190le_alt,bool))),X0)),
inference(rectify,[],[f127]) ).
tff(f127,negated_conjecture,
~ ? [X35: fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)] : pp(aa(fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool),bool,order_215145569der_on(arrow_411405190le_alt,top_top(fun(arrow_411405190le_alt,bool))),X35)),
inference(negated_conjecture,[],[f126]) ).
tff(f126,conjecture,
? [X35: fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)] : pp(aa(fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool),bool,order_215145569der_on(arrow_411405190le_alt,top_top(fun(arrow_411405190le_alt,bool))),X35)),
file('/export/starexec/sandbox2/tmp/tmp.LLqbWqWBJN/Vampire---4.8_25449',conj_2) ).
tff(f161,plain,
order_1409979114der_on(arrow_411405190le_alt,top_top(fun(arrow_411405190le_alt,bool)),r),
inference(cnf_transformation,[],[f124]) ).
tff(f124,axiom,
order_1409979114der_on(arrow_411405190le_alt,top_top(fun(arrow_411405190le_alt,bool)),r),
file('/export/starexec/sandbox2/tmp/tmp.LLqbWqWBJN/Vampire---4.8_25449',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.10 % Problem : SCT179_5 : TPTP v8.1.2. Released v6.0.0.
% 0.04/0.11 % 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.10/0.31 % Computer : n019.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri May 3 13:02:14 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 This is a TF1_THM_EQU_NAR problem
% 0.16/0.31 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.LLqbWqWBJN/Vampire---4.8_25449
% 0.60/0.80 % (25568)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.60/0.80 % (25570)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.60/0.80 % (25569)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.60/0.80 % (25566)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.60/0.80 % (25571)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.60/0.80 % (25567)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.60/0.80 % (25572)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.60/0.80 % (25571)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.60/0.81 % (25568)First to succeed.
% 0.60/0.81 % (25571)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.60/0.81 % (25565)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.60/0.81 % (25568)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-25559"
% 0.60/0.81 % (25572)Also succeeded, but the first one will report.
% 0.60/0.81 % (25570)Also succeeded, but the first one will report.
% 0.60/0.81 % (25568)Refutation found. Thanks to Tanya!
% 0.60/0.81 % SZS status Theorem for Vampire---4
% 0.60/0.81 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.81 % (25568)------------------------------
% 0.60/0.81 % (25568)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.81 % (25568)Termination reason: Refutation
% 0.60/0.81
% 0.60/0.81 % (25568)Memory used [KB]: 1092
% 0.60/0.81 % (25568)Time elapsed: 0.005 s
% 0.60/0.81 % (25568)Instructions burned: 5 (million)
% 0.60/0.81 % (25559)Success in time 0.49 s
% 0.60/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------