TSTP Solution File: LCL755_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL755_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 : n024.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 03:19:51 EDT 2024
% Result : Theorem 0.58s 0.76s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 47
% Syntax : Number of formulae : 64 ( 18 unt; 42 typ; 0 def)
% Number of atoms : 26 ( 7 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 8 ~; 2 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 49 ( 22 >; 27 *; 0 +; 0 <<)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 26 ( 26 usr; 5 con; 0-5 aty)
% Number of variables : 38 ( 17 !; 0 ?; 38 :)
% ( 21 !>; 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,
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,
abs: dB > dB ).
tff(func_def_4,type,
var: nat > dB ).
tff(func_def_5,type,
dB_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,X0)) * fun(dB,X0) * dB ) > X0 ) ).
tff(func_def_6,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_7,type,
lift: ( dB * nat ) > dB ).
tff(func_def_8,type,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_9,type,
subst: ( dB * dB * nat ) > dB ).
tff(func_def_10,type,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_11,type,
suc: nat > nat ).
tff(func_def_12,type,
nat_case:
!>[X0: $tType] : ( ( X0 * fun(nat,X0) * nat ) > X0 ) ).
tff(func_def_13,type,
nat_rec:
!>[X0: $tType] : ( ( X0 * fun(nat,fun(X0,X0)) * nat ) > X0 ) ).
tff(func_def_14,type,
semiri532925092at_aux:
!>[X0: $tType] : ( ( fun(X0,X0) * nat * X0 ) > X0 ) ).
tff(func_def_15,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_16,type,
fFalse: bool ).
tff(func_def_17,type,
fTrue: bool ).
tff(func_def_18,type,
ia: nat ).
tff(func_def_19,type,
ja: nat ).
tff(func_def_20,type,
ra: dB ).
tff(func_def_21,type,
sK0: ( nat * nat ) > nat ).
tff(func_def_22,type,
sK1: ( nat * nat ) > nat ).
tff(func_def_23,type,
sK2: ( nat * nat ) > nat ).
tff(func_def_24,type,
sK3: ( nat * nat ) > nat ).
tff(pred_def_1,type,
one:
!>[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,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
ab_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
linordered_semidom:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
cancel_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
cancel146912293up_add:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
ordere236663937imp_le:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
ordere223160158up_add:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
it: dB > $o ).
tff(pred_def_12,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_13,type,
pp: bool > $o ).
tff(f394,plain,
$false,
inference(unit_resulting_resolution,[],[f246,f382,f249]) ).
tff(f249,plain,
! [X0: dB] :
( it(abs(X0))
| ~ it(X0) ),
inference(cnf_transformation,[],[f183]) ).
tff(f183,plain,
! [X0: dB] :
( it(abs(X0))
| ~ it(X0) ),
inference(ennf_transformation,[],[f118]) ).
tff(f118,plain,
! [X0: dB] :
( it(X0)
=> it(abs(X0)) ),
inference(rectify,[],[f1]) ).
tff(f1,axiom,
! [X3: dB] :
( it(X3)
=> it(abs(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.LrwI0zxuE8/Vampire---4.8_27702',fact_0_Lambda) ).
tff(f382,plain,
~ it(abs(subst(ra,var(plus_plus(nat,ia,one_one(nat))),plus_plus(nat,ja,one_one(nat))))),
inference(forward_demodulation,[],[f381,f368]) ).
tff(f368,plain,
! [X0: nat] : ( plus_plus(nat,X0,one_one(nat)) = plus_plus(nat,one_one(nat),X0) ),
inference(definition_unfolding,[],[f316,f315]) ).
tff(f315,plain,
! [X0: nat] : ( suc(X0) = plus_plus(nat,one_one(nat),X0) ),
inference(cnf_transformation,[],[f168]) ).
tff(f168,plain,
! [X0: nat] : ( suc(X0) = plus_plus(nat,one_one(nat),X0) ),
inference(rectify,[],[f90]) ).
tff(f90,axiom,
! [X12: nat] : ( suc(X12) = plus_plus(nat,one_one(nat),X12) ),
file('/export/starexec/sandbox/tmp/tmp.LrwI0zxuE8/Vampire---4.8_27702',fact_89_Suc__eq__plus1__left) ).
tff(f316,plain,
! [X0: nat] : ( plus_plus(nat,X0,one_one(nat)) = suc(X0) ),
inference(cnf_transformation,[],[f169]) ).
tff(f169,plain,
! [X0: nat] : ( plus_plus(nat,X0,one_one(nat)) = suc(X0) ),
inference(rectify,[],[f89]) ).
tff(f89,axiom,
! [X12: nat] : ( suc(X12) = plus_plus(nat,X12,one_one(nat)) ),
file('/export/starexec/sandbox/tmp/tmp.LrwI0zxuE8/Vampire---4.8_27702',fact_88_Suc__eq__plus1) ).
tff(f381,plain,
~ it(abs(subst(ra,var(plus_plus(nat,one_one(nat),ia)),plus_plus(nat,ja,one_one(nat))))),
inference(forward_demodulation,[],[f330,f368]) ).
tff(f330,plain,
~ it(abs(subst(ra,var(plus_plus(nat,one_one(nat),ia)),plus_plus(nat,one_one(nat),ja)))),
inference(definition_unfolding,[],[f247,f315,f315]) ).
tff(f247,plain,
~ it(abs(subst(ra,var(suc(ia)),suc(ja)))),
inference(cnf_transformation,[],[f116]) ).
tff(f116,plain,
~ it(abs(subst(ra,var(suc(ia)),suc(ja)))),
inference(flattening,[],[f114]) ).
tff(f114,negated_conjecture,
~ it(abs(subst(ra,var(suc(ia)),suc(ja)))),
inference(negated_conjecture,[],[f113]) ).
tff(f113,conjecture,
it(abs(subst(ra,var(suc(ia)),suc(ja)))),
file('/export/starexec/sandbox/tmp/tmp.LrwI0zxuE8/Vampire---4.8_27702',conj_2) ).
tff(f246,plain,
! [X0: nat,X1: nat] : it(subst(ra,var(X0),X1)),
inference(cnf_transformation,[],[f115]) ).
tff(f115,plain,
! [X0: nat,X1: nat] : it(subst(ra,var(X0),X1)),
inference(rectify,[],[f112]) ).
tff(f112,axiom,
! [X49: nat,X50: nat] : it(subst(ra,var(X49),X50)),
file('/export/starexec/sandbox/tmp/tmp.LrwI0zxuE8/Vampire---4.8_27702',conj_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL755_5 : TPTP v8.1.2. Released v6.0.0.
% 0.14/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.15/0.36 % Computer : n024.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 : Tue Apr 30 16:38:51 EDT 2024
% 0.21/0.36 % CPUTime :
% 0.21/0.36 This is a TF1_THM_EQU_NAR problem
% 0.21/0.36 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.LrwI0zxuE8/Vampire---4.8_27702
% 0.58/0.75 % (27955)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.58/0.75 % (27949)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.58/0.75 % (27951)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.58/0.75 % (27955)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.58/0.75 % (27950)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.58/0.75 % (27952)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.58/0.75 % (27954)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.58/0.75 % (27953)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.58/0.75 % (27955)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.58/0.76 % (27955)First to succeed.
% 0.58/0.76 % (27949)Also succeeded, but the first one will report.
% 0.58/0.76 % (27955)Refutation found. Thanks to Tanya!
% 0.58/0.76 % SZS status Theorem for Vampire---4
% 0.58/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.76 % (27955)------------------------------
% 0.58/0.76 % (27955)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.58/0.76 % (27955)Termination reason: Refutation
% 0.58/0.76
% 0.58/0.76 % (27955)Memory used [KB]: 1171
% 0.58/0.76 % (27955)Time elapsed: 0.005 s
% 0.58/0.76 % (27955)Instructions burned: 11 (million)
% 0.58/0.76 % (27955)------------------------------
% 0.58/0.76 % (27955)------------------------------
% 0.58/0.76 % (27945)Success in time 0.387 s
% 0.58/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------