TSTP Solution File: SWW538_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWW538_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 : n021.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:51 EDT 2024
% Result : Theorem 0.61s 0.78s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 53
% Syntax : Number of formulae : 64 ( 14 unt; 49 typ; 0 def)
% Number of atoms : 16 ( 15 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 8 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 44 ( 26 >; 18 *; 0 +; 0 <<)
% Number of predicates : 18 ( 16 usr; 1 prp; 0-4 aty)
% Number of functors : 29 ( 29 usr; 5 con; 0-5 aty)
% Number of variables : 68 ( 27 !; 2 ?; 68 :)
% ( 39 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
a: $tType ).
tff(type_def_6,type,
bool: $tType ).
tff(type_def_7,type,
huffma1450048681e_tree: $tType > $tType ).
tff(type_def_8,type,
int: $tType ).
tff(type_def_9,type,
nat: $tType ).
tff(type_def_10,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
one_one:
!>[X0: $tType] : X0 ).
tff(func_def_1,type,
plus_plus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_2,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_3,type,
huffma675207370phabet:
!>[X0: $tType] : ( huffma1450048681e_tree(X0) > fun(X0,bool) ) ).
tff(func_def_4,type,
huffma854194513Weight:
!>[X0: $tType] : ( huffma1450048681e_tree(X0) > nat ) ).
tff(func_def_5,type,
huffma1134658180e_cost:
!>[X0: $tType] : ( huffma1450048681e_tree(X0) > nat ) ).
tff(func_def_6,type,
huffma410068972_depth:
!>[X0: $tType] : ( ( huffma1450048681e_tree(X0) * X0 ) > nat ) ).
tff(func_def_7,type,
huffma1352802255e_freq:
!>[X0: $tType] : ( ( huffma1450048681e_tree(X0) * X0 ) > nat ) ).
tff(func_def_8,type,
huffma945805758height:
!>[X0: $tType] : ( huffma1450048681e_tree(X0) > nat ) ).
tff(func_def_9,type,
huffma1146269203erNode:
!>[X0: $tType] : ( ( nat * huffma1450048681e_tree(X0) * huffma1450048681e_tree(X0) ) > huffma1450048681e_tree(X0) ) ).
tff(func_def_10,type,
huffma2021818691e_Leaf:
!>[X0: $tType] : ( ( nat * X0 ) > huffma1450048681e_tree(X0) ) ).
tff(func_def_11,type,
huffma107959123e_case:
!>[X0: $tType,X1: $tType] : ( ( fun(nat,fun(X0,X1)) * fun(nat,fun(huffma1450048681e_tree(X0),fun(huffma1450048681e_tree(X0),X1))) * huffma1450048681e_tree(X0) ) > X1 ) ).
tff(func_def_12,type,
huffma1280178957ee_rec:
!>[X0: $tType,X1: $tType] : ( ( fun(nat,fun(X0,X1)) * fun(nat,fun(huffma1450048681e_tree(X0),fun(huffma1450048681e_tree(X0),fun(X1,fun(X1,X1))))) * huffma1450048681e_tree(X0) ) > X1 ) ).
tff(func_def_13,type,
huffma1926487300e_size:
!>[X0: $tType] : ( ( fun(X0,nat) * huffma1450048681e_tree(X0) ) > nat ) ).
tff(func_def_14,type,
huffma921447403eTrees:
!>[X0: $tType] : ( ( huffma1450048681e_tree(X0) * huffma1450048681e_tree(X0) ) > huffma1450048681e_tree(X0) ) ).
tff(func_def_15,type,
huffma83463279weight:
!>[X0: $tType] : ( huffma1450048681e_tree(X0) > nat ) ).
tff(func_def_16,type,
if:
!>[X0: $tType] : ( ( bool * X0 * X0 ) > X0 ) ).
tff(func_def_17,type,
suc: nat > nat ).
tff(func_def_18,type,
nat_size: nat > nat ).
tff(func_def_19,type,
semiring_1_of_nat:
!>[X0: $tType] : ( nat > X0 ) ).
tff(func_def_20,type,
size_size:
!>[X0: $tType] : ( X0 > 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,
t_1: huffma1450048681e_tree(a) ).
tff(func_def_25,type,
t_2: huffma1450048681e_tree(a) ).
tff(func_def_26,type,
sK0: a ).
tff(pred_def_1,type,
one:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
semiring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
comm_semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
comm_monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
ab_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
cancel_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
cancel146912293up_add:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
linord219039673up_add:
!>[X0: $tType] : $o ).
tff(pred_def_12,type,
semiri456707255roduct:
!>[X0: $tType] : $o ).
tff(pred_def_13,type,
huffma1518433673istent:
!>[X0: $tType] : ( huffma1450048681e_tree(X0) > $o ) ).
tff(pred_def_14,type,
nat_tr1645093318rphism:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * fun(X0,bool) ) > $o ) ).
tff(pred_def_15,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_16,type,
pp: bool > $o ).
tff(f167,plain,
$false,
inference(unit_resulting_resolution,[],[f153,f155]) ).
tff(f155,plain,
plus_plus(nat,huffma1352802255e_freq(a,t_1,sK0),huffma1352802255e_freq(a,t_2,sK0)) != huffma1352802255e_freq(a,huffma1146269203erNode(a,plus_plus(nat,huffma854194513Weight(a,t_1),huffma854194513Weight(a,t_2)),t_1,t_2),sK0),
inference(definition_unfolding,[],[f143,f154]) ).
tff(f154,plain,
! [X0: $tType,X2: huffma1450048681e_tree(X0),X1: huffma1450048681e_tree(X0)] : ( huffma921447403eTrees(X0,X2,X1) = huffma1146269203erNode(X0,plus_plus(nat,huffma854194513Weight(X0,X2),huffma854194513Weight(X0,X1)),X2,X1) ),
inference(cnf_transformation,[],[f136]) ).
tff(f136,plain,
! [X0: $tType,X1: huffma1450048681e_tree(X0),X2: huffma1450048681e_tree(X0)] : ( huffma921447403eTrees(X0,X2,X1) = huffma1146269203erNode(X0,plus_plus(nat,huffma854194513Weight(X0,X2),huffma854194513Weight(X0,X1)),X2,X1) ),
inference(rectify,[],[f20]) ).
tff(f20,axiom,
! [X0: $tType,X9: huffma1450048681e_tree(X0),X10: huffma1450048681e_tree(X0)] : ( huffma921447403eTrees(X0,X10,X9) = huffma1146269203erNode(X0,plus_plus(nat,huffma854194513Weight(X0,X10),huffma854194513Weight(X0,X9)),X10,X9) ),
file('/export/starexec/sandbox/tmp/tmp.XGyOB3DStr/Vampire---4.8_21155',fact_19_uniteTrees__def) ).
tff(f143,plain,
huffma1352802255e_freq(a,huffma921447403eTrees(a,t_1,t_2),sK0) != plus_plus(nat,huffma1352802255e_freq(a,t_1,sK0),huffma1352802255e_freq(a,t_2,sK0)),
inference(cnf_transformation,[],[f140]) ).
tff(f140,plain,
huffma1352802255e_freq(a,huffma921447403eTrees(a,t_1,t_2),sK0) != plus_plus(nat,huffma1352802255e_freq(a,t_1,sK0),huffma1352802255e_freq(a,t_2,sK0)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f137,f139]) ).
tff(f139,plain,
( ? [X0: a] : ( huffma1352802255e_freq(a,huffma921447403eTrees(a,t_1,t_2),X0) != plus_plus(nat,huffma1352802255e_freq(a,t_1,X0),huffma1352802255e_freq(a,t_2,X0)) )
=> ( huffma1352802255e_freq(a,huffma921447403eTrees(a,t_1,t_2),sK0) != plus_plus(nat,huffma1352802255e_freq(a,t_1,sK0),huffma1352802255e_freq(a,t_2,sK0)) ) ),
introduced(choice_axiom,[]) ).
tff(f137,plain,
? [X0: a] : ( huffma1352802255e_freq(a,huffma921447403eTrees(a,t_1,t_2),X0) != plus_plus(nat,huffma1352802255e_freq(a,t_1,X0),huffma1352802255e_freq(a,t_2,X0)) ),
inference(ennf_transformation,[],[f128]) ).
tff(f128,plain,
~ ! [X0: a] : ( huffma1352802255e_freq(a,huffma921447403eTrees(a,t_1,t_2),X0) = plus_plus(nat,huffma1352802255e_freq(a,t_1,X0),huffma1352802255e_freq(a,t_2,X0)) ),
inference(rectify,[],[f127]) ).
tff(f127,negated_conjecture,
~ ! [X48: a] : ( huffma1352802255e_freq(a,huffma921447403eTrees(a,t_1,t_2),X48) = plus_plus(nat,huffma1352802255e_freq(a,t_1,X48),huffma1352802255e_freq(a,t_2,X48)) ),
inference(negated_conjecture,[],[f126]) ).
tff(f126,conjecture,
! [X48: a] : ( huffma1352802255e_freq(a,huffma921447403eTrees(a,t_1,t_2),X48) = plus_plus(nat,huffma1352802255e_freq(a,t_1,X48),huffma1352802255e_freq(a,t_2,X48)) ),
file('/export/starexec/sandbox/tmp/tmp.XGyOB3DStr/Vampire---4.8_21155',conj_0) ).
tff(f153,plain,
! [X0: $tType,X2: huffma1450048681e_tree(X0),X3: nat,X1: huffma1450048681e_tree(X0),X4: X0] : ( huffma1352802255e_freq(X0,huffma1146269203erNode(X0,X3,X2,X1),X4) = plus_plus(nat,huffma1352802255e_freq(X0,X2,X4),huffma1352802255e_freq(X0,X1,X4)) ),
inference(cnf_transformation,[],[f135]) ).
tff(f135,plain,
! [X0: $tType,X1: huffma1450048681e_tree(X0),X2: huffma1450048681e_tree(X0),X3: nat,X4: X0] : ( huffma1352802255e_freq(X0,huffma1146269203erNode(X0,X3,X2,X1),X4) = plus_plus(nat,huffma1352802255e_freq(X0,X2,X4),huffma1352802255e_freq(X0,X1,X4)) ),
inference(rectify,[],[f5]) ).
tff(f5,axiom,
! [X0: $tType,X9: huffma1450048681e_tree(X0),X10: huffma1450048681e_tree(X0),X11: nat,X12: X0] : ( huffma1352802255e_freq(X0,huffma1146269203erNode(X0,X11,X10,X9),X12) = plus_plus(nat,huffma1352802255e_freq(X0,X10,X12),huffma1352802255e_freq(X0,X9,X12)) ),
file('/export/starexec/sandbox/tmp/tmp.XGyOB3DStr/Vampire---4.8_21155',fact_4_freq_Osimps_I2_J) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWW538_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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.37 % Computer : n021.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 18:01:41 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.XGyOB3DStr/Vampire---4.8_21155
% 0.61/0.76 % (21606)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.61/0.77 % (21599)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.61/0.77 % (21602)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.77 % (21601)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.61/0.77 % (21603)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.61/0.77 % (21600)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.61/0.77 % (21604)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.61/0.77 % (21605)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.61/0.77 % (21605)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.61/0.77 % (21602)First to succeed.
% 0.61/0.77 % (21605)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.61/0.77 % (21604)Also succeeded, but the first one will report.
% 0.61/0.77 % (21599)Refutation not found, incomplete strategy% (21599)------------------------------
% 0.61/0.77 % (21599)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.77 % (21599)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.77
% 0.61/0.77 % (21599)Memory used [KB]: 1107
% 0.61/0.77 % (21599)Time elapsed: 0.006 s
% 0.61/0.77 % (21599)Instructions burned: 8 (million)
% 0.61/0.77 % (21599)------------------------------
% 0.61/0.77 % (21599)------------------------------
% 0.61/0.77 % (21605)Also succeeded, but the first one will report.
% 0.61/0.77 % (21603)Refutation not found, incomplete strategy% (21603)------------------------------
% 0.61/0.77 % (21603)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.77 % (21603)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.77
% 0.61/0.77 % (21603)Memory used [KB]: 1296
% 0.61/0.77 % (21603)Time elapsed: 0.008 s
% 0.61/0.77 % (21603)Instructions burned: 13 (million)
% 0.61/0.77 % (21603)------------------------------
% 0.61/0.77 % (21603)------------------------------
% 0.61/0.78 % (21602)Refutation found. Thanks to Tanya!
% 0.61/0.78 % SZS status Theorem for Vampire---4
% 0.61/0.78 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.78 % (21602)------------------------------
% 0.61/0.78 % (21602)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.78 % (21602)Termination reason: Refutation
% 0.61/0.78
% 0.61/0.78 % (21602)Memory used [KB]: 1096
% 0.61/0.78 % (21602)Time elapsed: 0.005 s
% 0.61/0.78 % (21602)Instructions burned: 5 (million)
% 0.61/0.78 % (21602)------------------------------
% 0.61/0.78 % (21602)------------------------------
% 0.61/0.78 % (21439)Success in time 0.385 s
% 0.61/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------