TSTP Solution File: SWW485_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWW485_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 : n006.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 04:19:36 EDT 2024
% Result : Theorem 0.60s 0.81s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 52
% Syntax : Number of formulae : 73 ( 6 unt; 44 typ; 0 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 62 ( 24 ~; 17 |; 10 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 31 ( 23 >; 8 *; 0 +; 0 <<)
% Number of predicates : 20 ( 19 usr; 5 prp; 0-3 aty)
% Number of functors : 25 ( 25 usr; 5 con; 0-4 aty)
% Number of variables : 68 ( 20 !; 6 ?; 68 :)
% ( 42 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
complex: $tType ).
tff(type_def_6,type,
bool: $tType ).
tff(type_def_7,type,
nat: $tType ).
tff(type_def_8,type,
poly1: $tType > $tType ).
tff(type_def_9,type,
real: $tType ).
tff(type_def_10,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_1,type,
order1:
!>[X0: $tType] : ( ( X0 * poly1(X0) ) > nat ) ).
tff(func_def_2,type,
poly:
!>[X0: $tType] : ( poly1(X0) > fun(X0,X0) ) ).
tff(func_def_3,type,
norm_norm:
!>[X0: $tType] : ( X0 > real ) ).
tff(func_def_4,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_5,type,
fFalse: bool ).
tff(func_def_6,type,
fTrue: bool ).
tff(func_def_7,type,
cs: poly1(complex) ).
tff(func_def_8,type,
r: real ).
tff(func_def_9,type,
sK0: real > complex ).
tff(func_def_10,type,
sK1:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_11,type,
sK2:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_12,type,
sK3:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_13,type,
sK4:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_14,type,
sK5:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_15,type,
sK6:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_16,type,
sK7:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_17,type,
sK8:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_18,type,
sK9:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_19,type,
sK10:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_20,type,
sK11:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_21,type,
sK12: real ).
tff(func_def_22,type,
sK13: ( real * real ) > real ).
tff(pred_def_1,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
idom:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
ord:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
ring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
order:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
linorder:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
preorder:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
comm_semiring_0:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
dense_linorder:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
real_normed_vector:
!>[X0: $tType] : $o ).
tff(pred_def_12,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_13,type,
ord_less_eq:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_14,type,
pp: bool > $o ).
tff(pred_def_16,type,
sQ14_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f365,plain,
$false,
inference(avatar_sat_refutation,[],[f355,f359,f360,f364]) ).
tff(f364,plain,
( ~ spl15_1
| ~ spl15_3 ),
inference(avatar_contradiction_clause,[],[f363]) ).
tff(f363,plain,
( $false
| ~ spl15_1
| ~ spl15_3 ),
inference(subsumption_resolution,[],[f361,f358]) ).
tff(f358,plain,
( ! [X0: real] : ord_less_eq(real,norm_norm(complex,sK0(X0)),r)
| ~ spl15_3 ),
inference(avatar_component_clause,[],[f357]) ).
tff(f357,plain,
( spl15_3
<=> ! [X0: real] : ord_less_eq(real,norm_norm(complex,sK0(X0)),r) ),
introduced(avatar_definition,[new_symbols(naming,[spl15_3])]) ).
tff(f361,plain,
( ~ ord_less_eq(real,norm_norm(complex,sK0(sK12)),r)
| ~ spl15_1 ),
inference(resolution,[],[f350,f274]) ).
tff(f274,plain,
! [X1: complex] :
( ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,cs),X1)),sK12)
| ~ ord_less_eq(real,norm_norm(complex,X1),r) ),
inference(cnf_transformation,[],[f235]) ).
tff(f235,plain,
( ! [X1: complex] :
( ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,cs),X1)),sK12)
| ~ ord_less_eq(real,norm_norm(complex,X1),r) )
& ord_less(real,zero_zero(real),sK12) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12])],[f197,f234]) ).
tff(f234,plain,
( ? [X0: real] :
( ! [X1: complex] :
( ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,cs),X1)),X0)
| ~ ord_less_eq(real,norm_norm(complex,X1),r) )
& ord_less(real,zero_zero(real),X0) )
=> ( ! [X1: complex] :
( ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,cs),X1)),sK12)
| ~ ord_less_eq(real,norm_norm(complex,X1),r) )
& ord_less(real,zero_zero(real),sK12) ) ),
introduced(choice_axiom,[]) ).
tff(f197,plain,
? [X0: real] :
( ! [X1: complex] :
( ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,cs),X1)),X0)
| ~ ord_less_eq(real,norm_norm(complex,X1),r) )
& ord_less(real,zero_zero(real),X0) ),
inference(ennf_transformation,[],[f156]) ).
tff(f156,plain,
? [X0: real] :
( ! [X1: complex] :
( ord_less_eq(real,norm_norm(complex,X1),r)
=> ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,cs),X1)),X0) )
& ord_less(real,zero_zero(real),X0) ),
inference(rectify,[],[f1]) ).
tff(f1,axiom,
? [X2: real] :
( ! [X3: complex] :
( ord_less_eq(real,norm_norm(complex,X3),r)
=> ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,cs),X3)),X2) )
& ord_less(real,zero_zero(real),X2) ),
file('/export/starexec/sandbox/tmp/tmp.X1WP4HMLyL/Vampire---4.8_31042',fact_0_pCons) ).
tff(f350,plain,
( ! [X0: real] : ~ ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,cs),sK0(X0))),X0)
| ~ spl15_1 ),
inference(avatar_component_clause,[],[f349]) ).
tff(f349,plain,
( spl15_1
<=> ! [X0: real] : ~ ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,cs),sK0(X0))),X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl15_1])]) ).
tff(f360,plain,
~ spl15_2,
inference(avatar_split_clause,[],[f251,f352]) ).
tff(f352,plain,
( spl15_2
<=> thesis ),
introduced(avatar_definition,[new_symbols(naming,[spl15_2])]) ).
tff(f251,plain,
~ thesis,
inference(cnf_transformation,[],[f144]) ).
tff(f144,plain,
~ thesis,
inference(flattening,[],[f142]) ).
tff(f142,negated_conjecture,
~ thesis,
inference(negated_conjecture,[],[f141]) ).
tff(f141,conjecture,
thesis,
file('/export/starexec/sandbox/tmp/tmp.X1WP4HMLyL/Vampire---4.8_31042',conj_1) ).
tff(f359,plain,
( spl15_3
| spl15_2 ),
inference(avatar_split_clause,[],[f249,f352,f357]) ).
tff(f249,plain,
! [X0: real] :
( thesis
| ord_less_eq(real,norm_norm(complex,sK0(X0)),r) ),
inference(cnf_transformation,[],[f218]) ).
tff(f218,plain,
! [X0: real] :
( thesis
| ( ~ ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,cs),sK0(X0))),X0)
& ord_less_eq(real,norm_norm(complex,sK0(X0)),r) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f179,f217]) ).
tff(f217,plain,
! [X0: real] :
( ? [X1: complex] :
( ~ ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,cs),X1)),X0)
& ord_less_eq(real,norm_norm(complex,X1),r) )
=> ( ~ ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,cs),sK0(X0))),X0)
& ord_less_eq(real,norm_norm(complex,sK0(X0)),r) ) ),
introduced(choice_axiom,[]) ).
tff(f179,plain,
! [X0: real] :
( thesis
| ? [X1: complex] :
( ~ ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,cs),X1)),X0)
& ord_less_eq(real,norm_norm(complex,X1),r) ) ),
inference(ennf_transformation,[],[f143]) ).
tff(f143,plain,
! [X0: real] :
( ! [X1: complex] :
( ord_less_eq(real,norm_norm(complex,X1),r)
=> ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,cs),X1)),X0) )
=> thesis ),
inference(rectify,[],[f140]) ).
tff(f140,axiom,
! [X40: real] :
( ! [X41: complex] :
( ord_less_eq(real,norm_norm(complex,X41),r)
=> ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,cs),X41)),X40) )
=> thesis ),
file('/export/starexec/sandbox/tmp/tmp.X1WP4HMLyL/Vampire---4.8_31042',conj_0) ).
tff(f355,plain,
( spl15_1
| spl15_2 ),
inference(avatar_split_clause,[],[f250,f352,f349]) ).
tff(f250,plain,
! [X0: real] :
( thesis
| ~ ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,cs),sK0(X0))),X0) ),
inference(cnf_transformation,[],[f218]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SWW485_5 : TPTP v8.1.2. Released v6.0.0.
% 0.02/0.11 % 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.11/0.31 % Computer : n006.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Apr 30 17:50:35 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 This is a TF1_THM_EQU_NAR problem
% 0.11/0.32 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.X1WP4HMLyL/Vampire---4.8_31042
% 0.60/0.81 % (31157)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 % (31160)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.81 % (31161)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.81 % (31159)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.81 % (31162)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.81 % (31158)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.81 % (31163)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.81 % (31164)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.81 % (31163)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.60/0.81 % (31164)First to succeed.
% 0.60/0.81 % (31163)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.60/0.81 % (31162)Also succeeded, but the first one will report.
% 0.60/0.81 % (31160)Also succeeded, but the first one will report.
% 0.60/0.81 % (31164)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 % (31164)------------------------------
% 0.60/0.81 % (31164)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.81 % (31164)Termination reason: Refutation
% 0.60/0.81
% 0.60/0.81 % (31164)Memory used [KB]: 1152
% 0.60/0.81 % (31164)Time elapsed: 0.005 s
% 0.60/0.81 % (31164)Instructions burned: 7 (million)
% 0.60/0.81 % (31164)------------------------------
% 0.60/0.81 % (31164)------------------------------
% 0.60/0.81 % (31153)Success in time 0.491 s
% 0.60/0.82 % Vampire---4.8 exiting
%------------------------------------------------------------------------------