TSTP Solution File: SWW513_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWW513_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 : n020.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 11:18:47 EDT 2024
% Result : Theorem 0.57s 0.75s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 47
% Syntax : Number of formulae : 59 ( 10 unt; 43 typ; 0 def)
% Number of atoms : 27 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 23 ( 12 ~; 7 |; 0 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 36 ( 23 >; 13 *; 0 +; 0 <<)
% Number of predicates : 15 ( 14 usr; 1 prp; 0-6 aty)
% Number of functors : 26 ( 26 usr; 7 con; 0-5 aty)
% Number of variables : 62 ( 21 !; 0 ?; 62 :)
% ( 41 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
a: $tType ).
tff(type_def_6,type,
state: $tType ).
tff(type_def_7,type,
bool: $tType ).
tff(type_def_8,type,
hoare_28830079triple: $tType > $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)) * 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,
uminus_uminus:
!>[X0: $tType] : fun(X0,X0) ).
tff(func_def_4,type,
ord_Least:
!>[X0: $tType] : ( fun(X0,bool) > X0 ) ).
tff(func_def_5,type,
ord_less_eq:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_6,type,
powp:
!>[X0: $tType] : ( fun(X0,bool) > fun(fun(X0,bool),bool) ) ).
tff(func_def_7,type,
ord_atLeast:
!>[X0: $tType] : ( X0 > fun(X0,bool) ) ).
tff(func_def_8,type,
ord_atMost:
!>[X0: $tType] : ( X0 > fun(X0,bool) ) ).
tff(func_def_9,type,
ord_greaterThan:
!>[X0: $tType] : ( X0 > fun(X0,bool) ) ).
tff(func_def_10,type,
ord_lessThan:
!>[X0: $tType] : ( X0 > fun(X0,bool) ) ).
tff(func_def_11,type,
collect:
!>[X0: $tType] : ( fun(X0,bool) > fun(X0,bool) ) ).
tff(func_def_12,type,
pow:
!>[X0: $tType] : ( fun(X0,bool) > fun(fun(X0,bool),bool) ) ).
tff(func_def_13,type,
image:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > fun(fun(X0,bool),fun(X1,bool)) ) ).
tff(func_def_14,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_15,type,
fFalse: bool ).
tff(func_def_16,type,
fNot: fun(bool,bool) ).
tff(func_def_17,type,
fTrue: bool ).
tff(func_def_18,type,
member:
!>[X0: $tType] : fun(X0,fun(fun(X0,bool),bool)) ).
tff(func_def_19,type,
g: fun(hoare_28830079triple(a),bool) ).
tff(func_def_20,type,
ga: fun(hoare_28830079triple(a),bool) ).
tff(func_def_21,type,
ts: fun(hoare_28830079triple(a),bool) ).
tff(func_def_22,type,
tsa: fun(hoare_28830079triple(a),bool) ).
tff(func_def_23,type,
sK0:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(X0,bool) ) > X0 ) ).
tff(pred_def_1,type,
enum:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
ord:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
order:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
linorder:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
preorder:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
wellorder:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
ordered_ab_group_add:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
enum_enum_all:
!>[X0: $tType] : ( fun(X0,bool) > $o ) ).
tff(pred_def_9,type,
hoare_992312373derivs:
!>[X0: $tType] : ( ( fun(hoare_28830079triple(X0),bool) * fun(hoare_28830079triple(X0),bool) ) > $o ) ).
tff(pred_def_10,type,
hoare_1442473487ek_and:
!>[X0: $tType] : ( ( fun(X0,fun(state,bool)) * fun(state,bool) * X0 * state ) > $o ) ).
tff(pred_def_11,type,
order_mono:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > $o ) ).
tff(pred_def_12,type,
order_strict_mono:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > $o ) ).
tff(pred_def_13,type,
inv_imagep:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X0,bool)) * fun(X1,X0) * X1 * X1 ) > $o ) ).
tff(pred_def_14,type,
pp: bool > $o ).
tff(f206,plain,
$false,
inference(subsumption_resolution,[],[f202,f147]) ).
tff(f147,plain,
pp(aa(fun(hoare_28830079triple(a),bool),bool,aa(fun(hoare_28830079triple(a),bool),fun(fun(hoare_28830079triple(a),bool),bool),ord_less_eq(fun(hoare_28830079triple(a),bool)),tsa),ts)),
inference(cnf_transformation,[],[f118]) ).
tff(f118,axiom,
pp(aa(fun(hoare_28830079triple(a),bool),bool,aa(fun(hoare_28830079triple(a),bool),fun(fun(hoare_28830079triple(a),bool),bool),ord_less_eq(fun(hoare_28830079triple(a),bool)),tsa),ts)),
file('/export/starexec/sandbox2/tmp/tmp.165gYqauiF/Vampire---4.8_2290',conj_1) ).
tff(f202,plain,
~ pp(aa(fun(hoare_28830079triple(a),bool),bool,aa(fun(hoare_28830079triple(a),bool),fun(fun(hoare_28830079triple(a),bool),bool),ord_less_eq(fun(hoare_28830079triple(a),bool)),tsa),ts)),
inference(resolution,[],[f161,f149]) ).
tff(f149,plain,
hoare_992312373derivs(a,ga,ts),
inference(cnf_transformation,[],[f120]) ).
tff(f120,axiom,
hoare_992312373derivs(a,ga,ts),
file('/export/starexec/sandbox2/tmp/tmp.165gYqauiF/Vampire---4.8_2290',conj_3) ).
tff(f161,plain,
! [X0: fun(hoare_28830079triple(a),bool)] :
( ~ hoare_992312373derivs(a,ga,X0)
| ~ pp(aa(fun(hoare_28830079triple(a),bool),bool,aa(fun(hoare_28830079triple(a),bool),fun(fun(hoare_28830079triple(a),bool),bool),ord_less_eq(fun(hoare_28830079triple(a),bool)),tsa),X0)) ),
inference(resolution,[],[f150,f158]) ).
tff(f158,plain,
! [X0: $tType,X2: fun(hoare_28830079triple(X0),bool),X3: fun(hoare_28830079triple(X0),bool),X1: fun(hoare_28830079triple(X0),bool)] :
( hoare_992312373derivs(X0,X3,X1)
| ~ pp(aa(fun(hoare_28830079triple(X0),bool),bool,aa(fun(hoare_28830079triple(X0),bool),fun(fun(hoare_28830079triple(X0),bool),bool),ord_less_eq(fun(hoare_28830079triple(X0),bool)),X1),X2))
| ~ hoare_992312373derivs(X0,X3,X2) ),
inference(cnf_transformation,[],[f142]) ).
tff(f142,plain,
! [X0: $tType,X1: fun(hoare_28830079triple(X0),bool),X2: fun(hoare_28830079triple(X0),bool),X3: fun(hoare_28830079triple(X0),bool)] :
( hoare_992312373derivs(X0,X3,X1)
| ~ pp(aa(fun(hoare_28830079triple(X0),bool),bool,aa(fun(hoare_28830079triple(X0),bool),fun(fun(hoare_28830079triple(X0),bool),bool),ord_less_eq(fun(hoare_28830079triple(X0),bool)),X1),X2))
| ~ hoare_992312373derivs(X0,X3,X2) ),
inference(flattening,[],[f141]) ).
tff(f141,plain,
! [X0: $tType,X1: fun(hoare_28830079triple(X0),bool),X2: fun(hoare_28830079triple(X0),bool),X3: fun(hoare_28830079triple(X0),bool)] :
( hoare_992312373derivs(X0,X3,X1)
| ~ pp(aa(fun(hoare_28830079triple(X0),bool),bool,aa(fun(hoare_28830079triple(X0),bool),fun(fun(hoare_28830079triple(X0),bool),bool),ord_less_eq(fun(hoare_28830079triple(X0),bool)),X1),X2))
| ~ hoare_992312373derivs(X0,X3,X2) ),
inference(ennf_transformation,[],[f130]) ).
tff(f130,plain,
! [X0: $tType,X1: fun(hoare_28830079triple(X0),bool),X2: fun(hoare_28830079triple(X0),bool),X3: fun(hoare_28830079triple(X0),bool)] :
( hoare_992312373derivs(X0,X3,X2)
=> ( pp(aa(fun(hoare_28830079triple(X0),bool),bool,aa(fun(hoare_28830079triple(X0),bool),fun(fun(hoare_28830079triple(X0),bool),bool),ord_less_eq(fun(hoare_28830079triple(X0),bool)),X1),X2))
=> hoare_992312373derivs(X0,X3,X1) ) ),
inference(rectify,[],[f2]) ).
tff(f2,axiom,
! [X1: $tType,X4: fun(hoare_28830079triple(X1),bool),X5: fun(hoare_28830079triple(X1),bool),X3: fun(hoare_28830079triple(X1),bool)] :
( hoare_992312373derivs(X1,X3,X5)
=> ( pp(aa(fun(hoare_28830079triple(X1),bool),bool,aa(fun(hoare_28830079triple(X1),bool),fun(fun(hoare_28830079triple(X1),bool),bool),ord_less_eq(fun(hoare_28830079triple(X1),bool)),X4),X5))
=> hoare_992312373derivs(X1,X3,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.165gYqauiF/Vampire---4.8_2290',fact_1_weaken) ).
tff(f150,plain,
~ hoare_992312373derivs(a,ga,tsa),
inference(cnf_transformation,[],[f123]) ).
tff(f123,plain,
~ hoare_992312373derivs(a,ga,tsa),
inference(flattening,[],[f122]) ).
tff(f122,negated_conjecture,
~ hoare_992312373derivs(a,ga,tsa),
inference(negated_conjecture,[],[f121]) ).
tff(f121,conjecture,
hoare_992312373derivs(a,ga,tsa),
file('/export/starexec/sandbox2/tmp/tmp.165gYqauiF/Vampire---4.8_2290',conj_4) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWW513_5 : TPTP v8.1.2. Released v6.0.0.
% 0.12/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.15/0.36 % Computer : n020.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 19:23:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TF1_THM_EQU_NAR problem
% 0.15/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.165gYqauiF/Vampire---4.8_2290
% 0.57/0.74 % (2670)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 (2996ds/56Mi)
% 0.57/0.75 % (2663)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.57/0.75 % (2665)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.57/0.75 % (2664)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.57/0.75 % (2667)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.57/0.75 % (2666)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.57/0.75 % (2668)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.57/0.75 % (2669)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.57/0.75 % (2670)First to succeed.
% 0.57/0.75 % (2670)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2558"
% 0.57/0.75 % (2669)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.57/0.75 % (2669)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.57/0.75 % (2670)Refutation found. Thanks to Tanya!
% 0.57/0.75 % SZS status Theorem for Vampire---4
% 0.57/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.75 % (2670)------------------------------
% 0.57/0.75 % (2670)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75 % (2670)Termination reason: Refutation
% 0.57/0.75
% 0.57/0.75 % (2670)Memory used [KB]: 1128
% 0.57/0.75 % (2670)Time elapsed: 0.004 s
% 0.57/0.75 % (2670)Instructions burned: 7 (million)
% 0.57/0.75 % (2558)Success in time 0.375 s
% 0.57/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------