TSTP Solution File: LCL756_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL756_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 : 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 : Sun May 5 07:42:12 EDT 2024
% Result : Theorem 0.69s 0.89s
% Output : Refutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 39
% Syntax : Number of formulae : 45 ( 8 unt; 37 typ; 0 def)
% Number of atoms : 8 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 39 ( 18 >; 21 *; 0 +; 0 <<)
% Number of predicates : 15 ( 14 usr; 1 prp; 0-3 aty)
% Number of functors : 20 ( 20 usr; 5 con; 0-5 aty)
% Number of variables : 24 ( 6 !; 0 ?; 24 :)
% ( 18 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
dB: $tType ).
tff(type_def_7,type,
nat: $tType ).
tff(type_def_8,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
plus_plus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_1,type,
var: nat > dB ).
tff(func_def_2,type,
dB_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,X0)) * fun(dB,X0) * dB ) > X0 ) ).
tff(func_def_3,type,
dB_rec:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,fun(X0,fun(X0,X0)))) * fun(dB,fun(X0,X0)) * dB ) > X0 ) ).
tff(func_def_4,type,
lift: ( dB * nat ) > dB ).
tff(func_def_5,type,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_6,type,
subst: ( dB * dB * nat ) > dB ).
tff(func_def_7,type,
suc: nat > nat ).
tff(func_def_8,type,
semiri532925092at_aux:
!>[X0: $tType] : ( ( fun(X0,X0) * nat * X0 ) > X0 ) ).
tff(func_def_9,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_10,type,
fFalse: bool ).
tff(func_def_11,type,
fTrue: bool ).
tff(func_def_12,type,
ia: nat ).
tff(func_def_13,type,
ja: nat ).
tff(func_def_14,type,
ra: dB ).
tff(func_def_15,type,
sK0: ( nat * nat ) > nat ).
tff(func_def_16,type,
sK1: ( nat * nat ) > nat ).
tff(func_def_17,type,
sK2: ( nat * nat ) > nat ).
tff(func_def_18,type,
sK3: ( nat * nat ) > nat ).
tff(pred_def_1,type,
ord:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
order:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
semiring_1:
!>[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,
ab_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
dense_linorder:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
cancel_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
cancel146912293up_add:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
ordere236663937imp_le:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
ordere223160158up_add:
!>[X0: $tType] : $o ).
tff(pred_def_12,type,
it: dB > $o ).
tff(pred_def_13,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_14,type,
pp: bool > $o ).
tff(f234,plain,
$false,
inference(subsumption_resolution,[],[f189,f188]) ).
tff(f188,plain,
! [X0: nat,X1: nat] : it(subst(ra,var(X0),X1)),
inference(cnf_transformation,[],[f120]) ).
tff(f120,plain,
! [X0: nat,X1: nat] : it(subst(ra,var(X0),X1)),
inference(rectify,[],[f117]) ).
tff(f117,axiom,
! [X47: nat,X48: nat] : it(subst(ra,var(X47),X48)),
file('/export/starexec/sandbox2/tmp/tmp.b7LsZJG94K/Vampire---4.8_32532',conj_1) ).
tff(f189,plain,
~ it(subst(ra,var(suc(ia)),suc(ja))),
inference(cnf_transformation,[],[f121]) ).
tff(f121,plain,
~ it(subst(ra,var(suc(ia)),suc(ja))),
inference(flattening,[],[f119]) ).
tff(f119,negated_conjecture,
~ it(subst(ra,var(suc(ia)),suc(ja))),
inference(negated_conjecture,[],[f118]) ).
tff(f118,conjecture,
it(subst(ra,var(suc(ia)),suc(ja))),
file('/export/starexec/sandbox2/tmp/tmp.b7LsZJG94K/Vampire---4.8_32532',conj_2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL756_5 : TPTP v8.1.2. Released v6.0.0.
% 0.12/0.14 % 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.34 % Computer : n006.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Fri May 3 13:16:34 EDT 2024
% 0.20/0.35 % CPUTime :
% 0.20/0.35 This is a TF1_THM_EQU_NAR problem
% 0.20/0.35 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.b7LsZJG94K/Vampire---4.8_32532
% 0.69/0.88 % (313)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 (2994ds/34Mi)
% 0.69/0.88 % (318)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2994ds/45Mi)
% 0.69/0.88 % (315)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2994ds/78Mi)
% 0.69/0.88 % (314)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 (2994ds/51Mi)
% 0.69/0.88 % (316)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2994ds/33Mi)
% 0.69/0.88 % (317)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 (2994ds/34Mi)
% 0.69/0.88 % (319)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 (2994ds/83Mi)
% 0.69/0.88 % (320)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 (2994ds/56Mi)
% 0.69/0.88 % (319)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.69/0.88 % (316)First to succeed.
% 0.69/0.88 % (313)Also succeeded, but the first one will report.
% 0.69/0.88 % (315)Also succeeded, but the first one will report.
% 0.69/0.88 % (316)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-32748"
% 0.69/0.88 % (318)Also succeeded, but the first one will report.
% 0.69/0.88 % (319)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.69/0.89 % (316)Refutation found. Thanks to Tanya!
% 0.69/0.89 % SZS status Theorem for Vampire---4
% 0.69/0.89 % SZS output start Proof for Vampire---4
% See solution above
% 0.69/0.89 % (316)------------------------------
% 0.69/0.89 % (316)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.69/0.89 % (316)Termination reason: Refutation
% 0.69/0.89
% 0.69/0.89 % (316)Memory used [KB]: 1081
% 0.69/0.89 % (316)Time elapsed: 0.004 s
% 0.69/0.89 % (316)Instructions burned: 4 (million)
% 0.69/0.89 % (32748)Success in time 0.529 s
% 0.69/0.89 % Vampire---4.8 exiting
%------------------------------------------------------------------------------