TSTP Solution File: COM122_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : COM122_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 : n020.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 04:46:54 EDT 2024
% Result : Theorem 0.58s 0.76s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 70
% Syntax : Number of formulae : 81 ( 9 unt; 66 typ; 0 def)
% Number of atoms : 21 ( 9 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 18 ( 12 ~; 3 |; 0 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of FOOLs : 1 ( 1 fml; 0 var)
% Number of types : 5 ( 4 usr)
% Number of type conns : 75 ( 37 >; 38 *; 0 +; 0 <<)
% Number of predicates : 18 ( 16 usr; 1 prp; 0-3 aty)
% Number of functors : 46 ( 46 usr; 9 con; 0-6 aty)
% Number of variables : 63 ( 8 !; 0 ?; 63 :)
% ( 55 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
int: $tType ).
tff(type_def_7,type,
list: $tType > $tType ).
tff(type_def_8,type,
nat: $tType ).
tff(type_def_9,type,
atom: $tType ).
tff(type_def_10,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
combi:
!>[X0: $tType] : fun(X0,X0) ).
tff(func_def_1,type,
one_one:
!>[X0: $tType] : X0 ).
tff(func_def_2,type,
sgn_sgn:
!>[X0: $tType] : ( X0 > X0 ) ).
tff(func_def_3,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_4,type,
ring_1_of_int:
!>[X0: $tType] : ( int > X0 ) ).
tff(func_def_5,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_6,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_7,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_8,type,
map:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * list(X0) ) > list(X1) ) ).
tff(func_def_9,type,
member1:
!>[X0: $tType] : fun(list(X0),fun(X0,bool)) ).
tff(func_def_10,type,
set:
!>[X0: $tType] : fun(list(X0),fun(X0,bool)) ).
tff(func_def_11,type,
sublist:
!>[X0: $tType] : ( ( list(X0) * fun(nat,bool) ) > list(X0) ) ).
tff(func_def_12,type,
semiring_1_Nats:
!>[X0: $tType] : fun(X0,bool) ).
tff(func_def_13,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_14,type,
asubst: ( int * list(int) * atom ) > atom ).
tff(func_def_15,type,
dvd: ( int * int * list(int) ) > atom ).
tff(func_def_16,type,
atom_size: atom > nat ).
tff(func_def_17,type,
decr_Z: atom > atom ).
tff(func_def_18,type,
divisor: atom > int ).
tff(func_def_19,type,
hd_coeff: fun(atom,int) ).
tff(func_def_20,type,
hd_coeff1: int > fun(atom,atom) ).
tff(func_def_21,type,
zlcms: list(int) > int ).
tff(func_def_22,type,
qEpres1907640072oeffs1: list(atom) > list(atom) ).
tff(func_def_23,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_24,type,
fFalse: bool ).
tff(func_def_25,type,
fTrue: bool ).
tff(func_def_26,type,
a: atom ).
tff(func_def_27,type,
as: list(atom) ).
tff(func_def_28,type,
b: atom ).
tff(func_def_29,type,
sK0:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_30,type,
sK1:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > X1 ) ).
tff(func_def_31,type,
sK2:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > list(X1) ) ).
tff(func_def_32,type,
sK3:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > X0 ) ).
tff(func_def_33,type,
sK4:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > list(X0) ) ).
tff(func_def_34,type,
sK5:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) * list(X1) ) > X1 ) ).
tff(func_def_35,type,
sK6:
!>[X0: $tType] : ( ( fun(X0,X0) * list(X0) ) > X0 ) ).
tff(func_def_36,type,
sK7:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) * list(X1) ) > X1 ) ).
tff(func_def_37,type,
sK8:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * list(X0) ) > list(X1) ) ).
tff(func_def_38,type,
sK9:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * list(X0) ) > X0 ) ).
tff(func_def_39,type,
sK10:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * X0 ) > X1 ) ).
tff(func_def_40,type,
sK11:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * list(X1) * fun(X1,X0) ) > X1 ) ).
tff(func_def_41,type,
sK12: atom ).
tff(func_def_42,type,
sK13: atom ).
tff(func_def_43,type,
sK14: atom ).
tff(pred_def_1,type,
one:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
ring_1:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
sgn_if:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
ring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
zero_neq_one:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
linordered_semidom:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
iszero:
!>[X0: $tType] : ( X0 > $o ) ).
tff(pred_def_11,type,
listMem:
!>[X0: $tType] : ( ( X0 * list(X0) ) > $o ) ).
tff(pred_def_12,type,
list_ex1:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_13,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_14,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_15,type,
pp: bool > $o ).
tff(pred_def_16,type,
sQ15_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f276,plain,
$false,
inference(subsumption_resolution,[],[f275,f187]) ).
tff(f187,plain,
member(atom,b,aa(list(atom),fun(atom,bool),set(atom),as)),
inference(cnf_transformation,[],[f4]) ).
tff(f4,axiom,
member(atom,b,aa(list(atom),fun(atom,bool),set(atom),as)),
file('/export/starexec/sandbox/tmp/tmp.KJGEIssxyt/Vampire---4.8_10493',fact_3__096b_A_058_Aset_Aas_096) ).
tff(f275,plain,
~ member(atom,b,aa(list(atom),fun(atom,bool),set(atom),as)),
inference(resolution,[],[f236,f237]) ).
tff(f237,plain,
! [X0: atom] :
( ~ sQ15_eqProxy(int,zero_zero(int),aa(atom,int,hd_coeff,X0))
| ~ member(atom,X0,aa(list(atom),fun(atom,bool),set(atom),as)) ),
inference(equality_proxy_replacement,[],[f184,f235]) ).
tff(f235,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ15_eqProxy(X0,X1,X2)
<=> ( X1 = X2 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ15_eqProxy])]) ).
tff(f184,plain,
! [X0: atom] :
( ( zero_zero(int) != aa(atom,int,hd_coeff,X0) )
| ~ member(atom,X0,aa(list(atom),fun(atom,bool),set(atom),as)) ),
inference(cnf_transformation,[],[f139]) ).
tff(f139,plain,
! [X0: atom] :
( ( zero_zero(int) != aa(atom,int,hd_coeff,X0) )
| ~ member(atom,X0,aa(list(atom),fun(atom,bool),set(atom),as)) ),
inference(ennf_transformation,[],[f119]) ).
tff(f119,plain,
! [X0: atom] :
( member(atom,X0,aa(list(atom),fun(atom,bool),set(atom),as))
=> ( zero_zero(int) != aa(atom,int,hd_coeff,X0) ) ),
inference(rectify,[],[f3]) ).
tff(f3,axiom,
! [X2: atom] :
( member(atom,X2,aa(list(atom),fun(atom,bool),set(atom),as))
=> ( zero_zero(int) != aa(atom,int,hd_coeff,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.KJGEIssxyt/Vampire---4.8_10493',fact_2_hd0) ).
tff(f236,plain,
sQ15_eqProxy(int,zero_zero(int),aa(atom,int,hd_coeff,b)),
inference(equality_proxy_replacement,[],[f183,f235]) ).
tff(f183,plain,
zero_zero(int) = aa(atom,int,hd_coeff,b),
inference(cnf_transformation,[],[f118]) ).
tff(f118,plain,
zero_zero(int) = aa(atom,int,hd_coeff,b),
inference(flattening,[],[f117]) ).
tff(f117,negated_conjecture,
( ~ zero_zero(int) != aa(atom,int,hd_coeff,b) ),
inference(negated_conjecture,[],[f116]) ).
tff(f116,conjecture,
zero_zero(int) != aa(atom,int,hd_coeff,b),
file('/export/starexec/sandbox/tmp/tmp.KJGEIssxyt/Vampire---4.8_10493',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : COM122_5 : TPTP v8.1.2. Released v6.0.0.
% 0.12/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.36 % Computer : n020.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 21:24:53 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a TF1_THM_EQU_NAR problem
% 0.16/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.KJGEIssxyt/Vampire---4.8_10493
% 0.58/0.76 % (10806)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.58/0.76 % (10799)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.76 % (10801)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.76 % (10800)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.76 % (10804)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.76 % (10803)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.76 % (10802)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.76 % (10805)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.76 % (10806)First to succeed.
% 0.58/0.76 % (10806)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-10738"
% 0.58/0.76 % (10802)Also succeeded, but the first one will report.
% 0.58/0.76 % (10805)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.58/0.76 % (10806)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 % (10806)------------------------------
% 0.58/0.76 % (10806)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.76 % (10806)Termination reason: Refutation
% 0.58/0.76
% 0.58/0.76 % (10806)Memory used [KB]: 1111
% 0.58/0.76 % (10806)Time elapsed: 0.004 s
% 0.58/0.76 % (10806)Instructions burned: 8 (million)
% 0.58/0.76 % (10738)Success in time 0.387 s
% 0.58/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------