TSTP Solution File: LCL792_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL792_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 : 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 07:42:32 EDT 2024
% Result : Theorem 0.57s 0.74s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 50
% Syntax : Number of formulae : 59 ( 8 unt; 47 typ; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 2 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 8 ( 7 usr)
% Number of type conns : 37 ( 22 >; 15 *; 0 +; 0 <<)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-3 aty)
% Number of functors : 24 ( 24 usr; 5 con; 0-4 aty)
% Number of variables : 34 ( 8 !; 0 ?; 34 :)
% ( 26 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
int: $tType ).
tff(type_def_7,type,
dB: $tType ).
tff(type_def_8,type,
nat: $tType ).
tff(type_def_9,type,
char1: $tType ).
tff(type_def_10,type,
literal: $tType ).
tff(type_def_11,type,
nibble: $tType ).
tff(type_def_12,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
sgn_sgn:
!>[X0: $tType] : ( X0 > X0 ) ).
tff(func_def_1,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_2,type,
bool_size: bool > nat ).
tff(func_def_3,type,
if:
!>[X0: $tType] : ( ( bool * X0 * X0 ) > X0 ) ).
tff(func_def_4,type,
nat1: int > nat ).
tff(func_def_5,type,
ring_1_of_int:
!>[X0: $tType] : ( int > X0 ) ).
tff(func_def_6,type,
lift: ( dB * nat ) > dB ).
tff(func_def_7,type,
nat_case:
!>[X0: $tType] : ( ( X0 * fun(nat,X0) * nat ) > X0 ) ).
tff(func_def_8,type,
nat_size: nat > nat ).
tff(func_def_9,type,
semiring_1_of_nat:
!>[X0: $tType] : ( nat > X0 ) ).
tff(func_def_10,type,
semiri532925092at_aux:
!>[X0: $tType] : ( ( fun(X0,X0) * nat * X0 ) > X0 ) ).
tff(func_def_11,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_12,type,
nat_tsub: ( int * int ) > int ).
tff(func_def_13,type,
char: ( nibble * nibble ) > char1 ).
tff(func_def_14,type,
char_case:
!>[X0: $tType] : ( ( fun(nibble,fun(nibble,X0)) * char1 ) > X0 ) ).
tff(func_def_15,type,
char_rec:
!>[X0: $tType] : ( ( fun(nibble,fun(nibble,X0)) * char1 ) > X0 ) ).
tff(func_def_16,type,
char_size: char1 > nat ).
tff(func_def_17,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_18,type,
fFalse: bool ).
tff(func_def_19,type,
fTrue: bool ).
tff(func_def_20,type,
t: dB ).
tff(func_def_21,type,
u: dB ).
tff(func_def_22,type,
ua: dB ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
ring_1:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
sgn_if:
!>[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,
semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
linorder:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
preorder:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
semiring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_12,type,
linordered_semidom:
!>[X0: $tType] : $o ).
tff(pred_def_13,type,
it: dB > $o ).
tff(pred_def_14,type,
ord_less_eq:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_15,type,
pp: bool > $o ).
tff(pred_def_16,type,
sQ0_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f174,plain,
$false,
inference(subsumption_resolution,[],[f173,f166]) ).
tff(f166,plain,
it(u),
inference(cnf_transformation,[],[f3]) ).
tff(f3,axiom,
it(u),
file('/export/starexec/sandbox/tmp/tmp.BkKP2jqo5a/Vampire---4.8_23236',fact_2_uIT) ).
tff(f173,plain,
~ it(u),
inference(resolution,[],[f155,f156]) ).
tff(f156,plain,
! [X0: nat,X1: dB] :
( it(lift(X1,X0))
| ~ it(X1) ),
inference(cnf_transformation,[],[f148]) ).
tff(f148,plain,
! [X0: nat,X1: dB] :
( it(lift(X1,X0))
| ~ it(X1) ),
inference(ennf_transformation,[],[f139]) ).
tff(f139,plain,
! [X0: nat,X1: dB] :
( it(X1)
=> it(lift(X1,X0)) ),
inference(rectify,[],[f4]) ).
tff(f4,axiom,
! [X3: nat,X4: dB] :
( it(X4)
=> it(lift(X4,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.BkKP2jqo5a/Vampire---4.8_23236',fact_3_lift__IT) ).
tff(f155,plain,
~ it(lift(u,zero_zero(nat))),
inference(cnf_transformation,[],[f138]) ).
tff(f138,plain,
~ it(lift(u,zero_zero(nat))),
inference(flattening,[],[f137]) ).
tff(f137,negated_conjecture,
~ it(lift(u,zero_zero(nat))),
inference(negated_conjecture,[],[f136]) ).
tff(f136,conjecture,
it(lift(u,zero_zero(nat))),
file('/export/starexec/sandbox/tmp/tmp.BkKP2jqo5a/Vampire---4.8_23236',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL792_5 : TPTP v8.1.2. Released v6.0.0.
% 0.13/0.14 % 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.14/0.35 % Computer : n015.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 13:56:21 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.BkKP2jqo5a/Vampire---4.8_23236
% 0.57/0.74 % (23351)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.57/0.74 % (23351)First to succeed.
% 0.57/0.74 % (23346)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.57/0.74 % (23344)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.57/0.74 % (23348)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.57/0.74 % (23345)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.57/0.74 % (23349)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.57/0.74 % (23347)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.57/0.74 % (23351)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-23343"
% 0.57/0.74 % (23350)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.57/0.74 % (23351)Refutation found. Thanks to Tanya!
% 0.57/0.74 % SZS status Theorem for Vampire---4
% 0.57/0.74 % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.74 % (23351)------------------------------
% 0.57/0.74 % (23351)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.74 % (23351)Termination reason: Refutation
% 0.57/0.74
% 0.57/0.74 % (23351)Memory used [KB]: 1088
% 0.57/0.74 % (23351)Time elapsed: 0.002 s
% 0.57/0.74 % (23351)Instructions burned: 3 (million)
% 0.57/0.74 % (23343)Success in time 0.378 s
% 0.57/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------