TSTP Solution File: SWW469_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWW469_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 : n015.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:17:49 EDT 2024
% Result : Theorem 0.59s 0.75s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 60
% Syntax : Number of formulae : 72 ( 10 unt; 57 typ; 0 def)
% Number of atoms : 20 ( 12 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 19 ( 14 ~; 2 |; 0 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 9 ( 8 usr)
% Number of type conns : 41 ( 25 >; 16 *; 0 +; 0 <<)
% Number of predicates : 20 ( 18 usr; 2 prp; 0-5 aty)
% Number of functors : 32 ( 32 usr; 5 con; 0-4 aty)
% Number of variables : 56 ( 5 !; 12 ?; 56 :)
% ( 39 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
com: $tType ).
tff(type_def_6,type,
state: $tType ).
tff(type_def_7,type,
node: ( $tType * $tType ) > $tType ).
tff(type_def_8,type,
bool: $tType ).
tff(type_def_9,type,
hoare_28830079triple: $tType > $tType ).
tff(type_def_10,type,
int: $tType ).
tff(type_def_11,type,
nat: $tType ).
tff(type_def_12,type,
char: $tType ).
tff(type_def_13,type,
literal: $tType ).
tff(type_def_14,type,
nibble: $tType ).
tff(type_def_15,type,
fun: ( $tType * $tType ) > $tType ).
tff(type_def_16,type,
sum_sum: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
one_one:
!>[X0: $tType] : X0 ).
tff(func_def_1,type,
sgn_sgn:
!>[X0: $tType] : ( X0 > X0 ) ).
tff(func_def_2,type,
uminus_uminus:
!>[X0: $tType] : ( X0 > X0 ) ).
tff(func_def_3,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_4,type,
bool_size: bool > nat ).
tff(func_def_5,type,
equal_equal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_6,type,
hoare_689268419triple:
!>[X0: $tType] : fun(fun(node(sum_sum(com,fun(X0,fun(state,bool))),sum_sum(state,X0)),bool),hoare_28830079triple(X0)) ).
tff(func_def_7,type,
hoare_334633230triple:
!>[X0: $tType] : fun(hoare_28830079triple(X0),fun(node(sum_sum(com,fun(X0,fun(state,bool))),sum_sum(state,X0)),bool)) ).
tff(func_def_8,type,
hoare_1841697145triple:
!>[X0: $tType] : ( ( fun(X0,fun(state,bool)) * com * fun(X0,fun(state,bool)) ) > hoare_28830079triple(X0) ) ).
tff(func_def_9,type,
hoare_376461865e_case:
!>[X0: $tType,X1: $tType] : ( ( fun(fun(X0,fun(state,bool)),fun(com,fun(fun(X0,fun(state,bool)),X1))) * hoare_28830079triple(X0) ) > X1 ) ).
tff(func_def_10,type,
hoare_678420151le_rec:
!>[X0: $tType,X1: $tType] : ( ( fun(fun(X0,fun(state,bool)),fun(com,fun(fun(X0,fun(state,bool)),X1))) * hoare_28830079triple(X0) ) > X1 ) ).
tff(func_def_11,type,
hoare_711253694ep_set:
!>[X0: $tType] : fun(fun(node(sum_sum(com,fun(X0,fun(state,bool))),sum_sum(state,X0)),bool),bool) ).
tff(func_def_12,type,
hoare_47506394e_size:
!>[X0: $tType] : ( ( fun(X0,nat) * hoare_28830079triple(X0) ) > nat ) ).
tff(func_def_13,type,
nat_size: nat > nat ).
tff(func_def_14,type,
semiring_1_of_nat:
!>[X0: $tType] : ( nat > X0 ) ).
tff(func_def_15,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_16,type,
collect:
!>[X0: $tType] : ( fun(X0,bool) > fun(X0,bool) ) ).
tff(func_def_17,type,
char1: ( nibble * nibble ) > char ).
tff(func_def_18,type,
char_case:
!>[X0: $tType] : ( ( fun(nibble,fun(nibble,X0)) * char ) > X0 ) ).
tff(func_def_19,type,
char_rec:
!>[X0: $tType] : ( ( fun(nibble,fun(nibble,X0)) * char ) > X0 ) ).
tff(func_def_20,type,
char_size: char > nat ).
tff(func_def_21,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_22,type,
fFalse: bool ).
tff(func_def_23,type,
fTrue: bool ).
tff(func_def_24,type,
fequal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_25,type,
sK0: state ).
tff(func_def_26,type,
sK1: state ).
tff(func_def_27,type,
sK2: state ).
tff(pred_def_1,type,
enum:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
cl_HOL_Oequal:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
one:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
sgn_if:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
group_add:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
zero_neq_one:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
semiring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
linordered_semidom:
!>[X0: $tType] : $o ).
tff(pred_def_12,type,
linord219039673up_add:
!>[X0: $tType] : $o ).
tff(pred_def_13,type,
semigroup:
!>[X0: $tType] : ( fun(X0,fun(X0,X0)) > $o ) ).
tff(pred_def_17,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_18,type,
type_definition:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * fun(X1,X0) * fun(X1,bool) ) > $o ) ).
tff(pred_def_19,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_20,type,
pp: bool > $o ).
tff(f153,plain,
$false,
inference(subsumption_resolution,[],[f152,f148]) ).
tff(f148,plain,
! [X1: state] : ( sK0 = X1 ),
inference(cnf_transformation,[],[f145]) ).
tff(f145,plain,
? [X0: state] :
! [X1: state] : ( X0 = X1 ),
inference(ennf_transformation,[],[f142]) ).
tff(f142,plain,
~ ! [X0: state] :
? [X1: state] : ( X0 != X1 ),
inference(rectify,[],[f141]) ).
tff(f141,negated_conjecture,
~ ! [X52: state] :
? [X53: state] : ( X52 != X53 ),
inference(negated_conjecture,[],[f140]) ).
tff(f140,conjecture,
! [X52: state] :
? [X53: state] : ( X52 != X53 ),
file('/export/starexec/sandbox2/tmp/tmp.RFgMwbRzPm/Vampire---4.8_542',conj_1) ).
tff(f152,plain,
sK0 != sK1,
inference(forward_demodulation,[],[f150,f148]) ).
tff(f150,plain,
sK1 != sK2,
inference(unit_resulting_resolution,[],[f147,f149]) ).
tff(f149,plain,
( ~ hoare_531836380gleton
| ( sK1 != sK2 ) ),
inference(cnf_transformation,[],[f146]) ).
tff(f146,plain,
( ? [X0: state,X1: state] : ( X0 != X1 )
| ~ hoare_531836380gleton ),
inference(ennf_transformation,[],[f144]) ).
tff(f144,plain,
( hoare_531836380gleton
=> ? [X0: state,X1: state] : ( X0 != X1 ) ),
inference(unused_predicate_definition_removal,[],[f143]) ).
tff(f143,plain,
( hoare_531836380gleton
<=> ? [X0: state,X1: state] : ( X0 != X1 ) ),
inference(rectify,[],[f1]) ).
tff(f1,axiom,
( hoare_531836380gleton
<=> ? [X3: state,X4: state] : ( X3 != X4 ) ),
file('/export/starexec/sandbox2/tmp/tmp.RFgMwbRzPm/Vampire---4.8_542',fact_0_state__not__singleton__def) ).
tff(f147,plain,
hoare_531836380gleton,
inference(cnf_transformation,[],[f139]) ).
tff(f139,axiom,
hoare_531836380gleton,
file('/export/starexec/sandbox2/tmp/tmp.RFgMwbRzPm/Vampire---4.8_542',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWW469_5 : TPTP v8.1.2. Released v6.0.0.
% 0.07/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.14/0.36 % Computer : n015.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 19:32:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TF1_THM_EQU_NAR problem
% 0.14/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.RFgMwbRzPm/Vampire---4.8_542
% 0.59/0.75 % (743)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.59/0.75 % (735)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.59/0.75 % (738)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.59/0.75 % (736)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.59/0.75 % (737)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.59/0.75 % (742)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.59/0.75 % (743)First to succeed.
% 0.59/0.75 % (744)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.59/0.75 % (743)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-734"
% 0.59/0.75 % (743)Refutation found. Thanks to Tanya!
% 0.59/0.75 % SZS status Theorem for Vampire---4
% 0.59/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.75 % (743)------------------------------
% 0.59/0.75 % (743)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.75 % (743)Termination reason: Refutation
% 0.59/0.75
% 0.59/0.75 % (743)Memory used [KB]: 1082
% 0.59/0.75 % (743)Time elapsed: 0.003 s
% 0.59/0.75 % (743)Instructions burned: 4 (million)
% 0.59/0.75 % (734)Success in time 0.385 s
% 0.59/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------