TSTP Solution File: COM043_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : COM043_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 : n032.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:22 EDT 2024
% Result : Theorem 0.12s 0.57s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 55
% Syntax : Number of formulae : 65 ( 14 unt; 51 typ; 0 def)
% Number of atoms : 14 ( 13 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 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 : 25 ( 16 >; 9 *; 0 +; 0 <<)
% Number of predicates : 22 ( 20 usr; 1 prp; 0-2 aty)
% Number of functors : 27 ( 27 usr; 11 con; 0-4 aty)
% Number of variables : 39 ( 9 !; 0 ?; 39 :)
% ( 30 !>; 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,
div_mod:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_1,type,
one_one:
!>[X0: $tType] : X0 ).
tff(func_def_2,type,
plus_plus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_3,type,
uminus_uminus:
!>[X0: $tType] : ( X0 > X0 ) ).
tff(func_def_4,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_5,type,
iprod:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > X0 ) ).
tff(func_def_6,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_7,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_8,type,
nDvd: ( int * int * list(int) ) > atom ).
tff(func_def_9,type,
atom_size: atom > nat ).
tff(func_def_10,type,
divisor: atom > int ).
tff(func_def_11,type,
hd_coeff: atom > int ).
tff(func_def_12,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_13,type,
fFalse: bool ).
tff(func_def_14,type,
fTrue: bool ).
tff(func_def_15,type,
a: atom ).
tff(func_def_16,type,
d: int ).
tff(func_def_17,type,
e: list(int) ).
tff(func_def_18,type,
i: int ).
tff(func_def_19,type,
j: int ).
tff(func_def_20,type,
ks1: list(int) ).
tff(func_def_21,type,
ks: list(int) ).
tff(func_def_22,type,
l: int ).
tff(func_def_23,type,
sK0: list(int) ).
tff(func_def_24,type,
sK1:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(pred_def_1,type,
one:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
ring:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
cl_Groups_Oplus:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
uminus:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
ring_div:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
group_add:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
ab_group_add:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
semiring_div:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
comm_semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_12,type,
comm_monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_13,type,
ab_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_14,type,
boolean_algebra:
!>[X0: $tType] : $o ).
tff(pred_def_15,type,
cancel_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_16,type,
cancel146912293up_add:
!>[X0: $tType] : $o ).
tff(pred_def_17,type,
linord219039673up_add:
!>[X0: $tType] : $o ).
tff(pred_def_18,type,
semiri456707255roduct:
!>[X0: $tType] : $o ).
tff(pred_def_19,type,
nat_is_nat: int > $o ).
tff(pred_def_20,type,
pp: bool > $o ).
tff(f349,plain,
$false,
inference(subsumption_resolution,[],[f348,f247]) ).
tff(f247,plain,
div_mod(int,i,d) != div_mod(int,j,d),
inference(cnf_transformation,[],[f137]) ).
tff(f137,plain,
div_mod(int,i,d) != div_mod(int,j,d),
inference(flattening,[],[f136]) ).
tff(f136,negated_conjecture,
( ~ div_mod(int,i,d) = div_mod(int,j,d) ),
inference(negated_conjecture,[],[f135]) ).
tff(f135,conjecture,
div_mod(int,i,d) = div_mod(int,j,d),
file('/export/starexec/sandbox2/tmp/tmp.SOrfHxq6n1/Vampire---4.8_12910',conj_0) ).
tff(f348,plain,
div_mod(int,i,d) = div_mod(int,j,d),
inference(backward_demodulation,[],[f259,f347]) ).
tff(f347,plain,
d = divisor(a),
inference(superposition,[],[f265,f258]) ).
tff(f258,plain,
a = nDvd(d,l,ks),
inference(cnf_transformation,[],[f1]) ).
tff(f1,axiom,
a = nDvd(d,l,ks),
file('/export/starexec/sandbox2/tmp/tmp.SOrfHxq6n1/Vampire---4.8_12910',fact_0_NDvd) ).
tff(f265,plain,
! [X2: int,X0: list(int),X1: int] : ( divisor(nDvd(X2,X1,X0)) = X2 ),
inference(cnf_transformation,[],[f149]) ).
tff(f149,plain,
! [X0: list(int),X1: int,X2: int] : ( divisor(nDvd(X2,X1,X0)) = X2 ),
inference(rectify,[],[f64]) ).
tff(f64,axiom,
! [X26: list(int),X27: int,X28: int] : ( divisor(nDvd(X28,X27,X26)) = X28 ),
file('/export/starexec/sandbox2/tmp/tmp.SOrfHxq6n1/Vampire---4.8_12910',fact_63_divisor_Osimps_I3_J) ).
tff(f259,plain,
div_mod(int,i,divisor(a)) = div_mod(int,j,divisor(a)),
inference(cnf_transformation,[],[f2]) ).
tff(f2,axiom,
div_mod(int,i,divisor(a)) = div_mod(int,j,divisor(a)),
file('/export/starexec/sandbox2/tmp/tmp.SOrfHxq6n1/Vampire---4.8_12910',fact_1_assms_I3_J) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : COM043_5 : TPTP v8.1.2. Released v6.0.0.
% 0.00/0.09 % 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.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 300
% 0.08/0.27 % DateTime : Fri May 3 21:27:07 EDT 2024
% 0.08/0.28 % CPUTime :
% 0.08/0.28 This is a TF1_THM_EQU_NAR problem
% 0.08/0.28 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.SOrfHxq6n1/Vampire---4.8_12910
% 0.12/0.57 % (13073)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 (2997ds/34Mi)
% 0.12/0.57 % (13075)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2997ds/78Mi)
% 0.12/0.57 % (13079)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 (2997ds/83Mi)
% 0.12/0.57 % (13079)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.12/0.57 % (13076)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2997ds/33Mi)
% 0.12/0.57 % (13077)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 (2997ds/34Mi)
% 0.12/0.57 % (13078)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2997ds/45Mi)
% 0.12/0.57 % (13079)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.12/0.57 % (13074)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 (2997ds/51Mi)
% 0.12/0.57 % (13073)Refutation not found, incomplete strategy% (13073)------------------------------
% 0.12/0.57 % (13073)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.12/0.57 % (13073)Termination reason: Refutation not found, incomplete strategy
% 0.12/0.57
% 0.12/0.57 % (13073)Memory used [KB]: 1095
% 0.12/0.57 % (13073)Time elapsed: 0.003 s
% 0.12/0.57 % (13073)Instructions burned: 5 (million)
% 0.12/0.57 % (13073)------------------------------
% 0.12/0.57 % (13073)------------------------------
% 0.12/0.57 % (13079)Refutation not found, incomplete strategy% (13079)------------------------------
% 0.12/0.57 % (13079)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.12/0.57 % (13079)Termination reason: Refutation not found, incomplete strategy
% 0.12/0.57
% 0.12/0.57 % (13079)Memory used [KB]: 1139
% 0.12/0.57 % (13079)Time elapsed: 0.003 s
% 0.12/0.57 % (13079)Instructions burned: 8 (million)
% 0.12/0.57 % (13079)------------------------------
% 0.12/0.57 % (13079)------------------------------
% 0.12/0.57 % (13075)First to succeed.
% 0.12/0.57 % (13075)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-13071"
% 0.12/0.57 % (13075)Refutation found. Thanks to Tanya!
% 0.12/0.57 % SZS status Theorem for Vampire---4
% 0.12/0.57 % SZS output start Proof for Vampire---4
% See solution above
% 0.12/0.57 % (13075)------------------------------
% 0.12/0.57 % (13075)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.12/0.57 % (13075)Termination reason: Refutation
% 0.12/0.57
% 0.12/0.57 % (13075)Memory used [KB]: 1180
% 0.12/0.57 % (13075)Time elapsed: 0.004 s
% 0.12/0.57 % (13075)Instructions burned: 10 (million)
% 0.12/0.57 % (13071)Success in time 0.29 s
% 0.12/0.57 % Vampire---4.8 exiting
%------------------------------------------------------------------------------